/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:48:25,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:48:25,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:48:25,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:48:25,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:48:25,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:48:25,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:48:25,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:48:25,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:48:25,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:48:25,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:48:25,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:48:25,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:48:25,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:48:25,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:48:25,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:48:25,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:48:25,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:48:25,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:48:25,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:48:25,943 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:48:25,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:48:25,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:48:25,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:48:25,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:48:25,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:48:25,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:48:25,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:48:25,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:48:25,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:48:25,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:48:25,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:48:25,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:48:25,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:48:25,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:48:25,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:48:25,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:48:25,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:48:25,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:48:25,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:48:25,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:48:25,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:48:25,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:48:25,971 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:48:25,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:48:25,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:48:25,974 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:48:25,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:48:25,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:48:25,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:48:25,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:48:25,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:48:25,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:48:25,975 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:48:25,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:48:25,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:48:25,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:48:25,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:48:25,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:48:25,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:48:25,976 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:48:25,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:48:25,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:48:25,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:48:25,977 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:48:25,977 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:48:25,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:48:25,977 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:48:25,978 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:48:26,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:48:26,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:48:26,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:48:26,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:48:26,204 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:48:26,205 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2022-04-15 06:48:26,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3b1eabd/fa1523c194ab422eb093dbba79c399b3/FLAG6afcdc7db [2022-04-15 06:48:26,651 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:48:26,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_6.c [2022-04-15 06:48:26,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3b1eabd/fa1523c194ab422eb093dbba79c399b3/FLAG6afcdc7db [2022-04-15 06:48:26,667 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba3b1eabd/fa1523c194ab422eb093dbba79c399b3 [2022-04-15 06:48:26,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:48:26,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:48:26,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:48:26,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:48:26,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:48:26,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d02e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26, skipping insertion in model container [2022-04-15 06:48:26,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:48:26,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:48:26,819 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_6.c[318,331] [2022-04-15 06:48:26,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:48:26,838 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:48:26,849 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_6.c[318,331] [2022-04-15 06:48:26,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:48:26,865 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:48:26,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26 WrapperNode [2022-04-15 06:48:26,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:48:26,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:48:26,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:48:26,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:48:26,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:48:26,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:48:26,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:48:26,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:48:26,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (1/1) ... [2022-04-15 06:48:26,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:48:26,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:26,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:48:26,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:48:26,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:48:26,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:48:26,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:48:26,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:48:26,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:48:26,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:48:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:48:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:48:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:48:26,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:48:26,998 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:48:26,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:48:27,099 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:48:27,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:48:27,105 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:48:27,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:48:27 BoogieIcfgContainer [2022-04-15 06:48:27,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:48:27,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:48:27,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:48:27,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:48:27,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:48:26" (1/3) ... [2022-04-15 06:48:27,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a37cdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:48:27, skipping insertion in model container [2022-04-15 06:48:27,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:26" (2/3) ... [2022-04-15 06:48:27,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a37cdbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:48:27, skipping insertion in model container [2022-04-15 06:48:27,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:48:27" (3/3) ... [2022-04-15 06:48:27,113 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_6.c [2022-04-15 06:48:27,117 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:48:27,118 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:48:27,185 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:48:27,190 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:48:27,190 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:48:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:48:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:48:27,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:27,226 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:27,227 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:27,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1440262230, now seen corresponding path program 1 times [2022-04-15 06:48:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:27,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842294858] [2022-04-15 06:48:27,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:48:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1440262230, now seen corresponding path program 2 times [2022-04-15 06:48:27,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:27,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929656969] [2022-04-15 06:48:27,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:27,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 06:48:27,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:48:27,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #48#return; {25#true} is VALID [2022-04-15 06:48:27,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:27,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 06:48:27,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:48:27,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #48#return; {25#true} is VALID [2022-04-15 06:48:27,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret7 := main(); {25#true} is VALID [2022-04-15 06:48:27,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {30#(= main_~x~0 0)} is VALID [2022-04-15 06:48:27,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(= main_~x~0 0)} assume !(~x~0 < 1000000); {26#false} is VALID [2022-04-15 06:48:27,442 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {26#false} is VALID [2022-04-15 06:48:27,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 06:48:27,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:48:27,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:48:27,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929656969] [2022-04-15 06:48:27,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929656969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:27,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:27,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:27,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842294858] [2022-04-15 06:48:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842294858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:27,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:27,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454708198] [2022-04-15 06:48:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:48:27,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:27,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:27,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:48:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:27,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:48:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:48:27,524 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:27,714 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2022-04-15 06:48:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:48:27,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:48:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 06:48:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 06:48:27,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 06:48:27,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:27,786 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:48:27,786 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:48:27,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:48:27,791 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:27,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:48:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:48:27,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:27,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,817 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,819 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:27,826 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:48:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:48:27,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:27,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:27,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:48:27,841 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:48:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:27,843 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:48:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:48:27,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:27,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:27,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:27,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:48:27,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 06:48:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:27,847 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:48:27,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:27,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:48:27,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:48:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:48:27,869 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:27,869 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:27,869 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:48:27,870 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -273622713, now seen corresponding path program 1 times [2022-04-15 06:48:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:27,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1412535133] [2022-04-15 06:48:32,053 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:32,141 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:32,142 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -550999127, now seen corresponding path program 1 times [2022-04-15 06:48:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248398496] [2022-04-15 06:48:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:32,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {184#true} is VALID [2022-04-15 06:48:32,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#true} assume true; {184#true} is VALID [2022-04-15 06:48:32,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {184#true} {184#true} #48#return; {184#true} is VALID [2022-04-15 06:48:32,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {184#true} call ULTIMATE.init(); {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:32,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {184#true} is VALID [2022-04-15 06:48:32,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#true} assume true; {184#true} is VALID [2022-04-15 06:48:32,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184#true} {184#true} #48#return; {184#true} is VALID [2022-04-15 06:48:32,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {184#true} call #t~ret7 := main(); {184#true} is VALID [2022-04-15 06:48:32,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {184#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {189#(= main_~x~0 0)} is VALID [2022-04-15 06:48:32,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(= main_~x~0 0)} [54] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_15 v_main_~x~0_14)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_15)) (and (< v_main_~x~0_15 v_main_~x~0_14) (< v_main_~x~0_14 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_15, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_14, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {190#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:32,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(<= main_~x~0 500000)} [53] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {185#false} is VALID [2022-04-15 06:48:32,225 INFO L272 TraceCheckUtils]: 8: Hoare triple {185#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {185#false} is VALID [2022-04-15 06:48:32,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#false} ~cond := #in~cond; {185#false} is VALID [2022-04-15 06:48:32,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#false} assume 0 == ~cond; {185#false} is VALID [2022-04-15 06:48:32,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#false} assume !false; {185#false} is VALID [2022-04-15 06:48:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:32,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:32,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248398496] [2022-04-15 06:48:32,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248398496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:32,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:32,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:48:32,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:32,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1412535133] [2022-04-15 06:48:32,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1412535133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:32,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:32,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:48:32,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757887488] [2022-04-15 06:48:32,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:32,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:48:32,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:32,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:32,333 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:48:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:32,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:48:32,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:48:32,335 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:32,474 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 06:48:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:48:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:48:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 06:48:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-15 06:48:32,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-15 06:48:32,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:32,520 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:48:32,520 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:48:32,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:48:32,523 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:32,524 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:48:32,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:48:32,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:32,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,545 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,545 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:32,547 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:48:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:32,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:32,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:32,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:48:32,548 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:48:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:32,550 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:48:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:32,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:32,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:32,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:32,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 06:48:32,553 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2022-04-15 06:48:32,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:32,553 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 06:48:32,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:32,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 06:48:32,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:48:32,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:32,584 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:32,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:48:32,585 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -88759266, now seen corresponding path program 1 times [2022-04-15 06:48:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417809642] [2022-04-15 06:48:32,796 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:33,179 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:33,180 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1729789352, now seen corresponding path program 1 times [2022-04-15 06:48:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:33,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413090264] [2022-04-15 06:48:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:33,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:33,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {338#true} is VALID [2022-04-15 06:48:33,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} assume true; {338#true} is VALID [2022-04-15 06:48:33,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {338#true} {338#true} #48#return; {338#true} is VALID [2022-04-15 06:48:33,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {338#true} call ULTIMATE.init(); {346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:33,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {338#true} is VALID [2022-04-15 06:48:33,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#true} assume true; {338#true} is VALID [2022-04-15 06:48:33,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} #48#return; {338#true} is VALID [2022-04-15 06:48:33,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#true} call #t~ret7 := main(); {338#true} is VALID [2022-04-15 06:48:33,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {338#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {343#(= main_~x~0 0)} is VALID [2022-04-15 06:48:33,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#(= main_~x~0 0)} [56] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and (< v_main_~x~0_22 v_main_~x~0_21) (< v_main_~x~0_21 500001)) (and (not (< v_main_~x~0_22 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_22, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {344#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:33,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#(<= main_~x~0 500000)} [57] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:33,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#(<= main_~x~0 500000)} [58] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse1 (<= 500000 v_main_~x~0_24))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) .cse0 (or (not .cse1) (not (< v_main_~x~0_24 750000))) .cse2 .cse3) (and .cse0 .cse2 .cse3 (= v_main_~y~0_5 v_main_~y~0_4)) (and .cse1 (= (+ v_main_~x~0_24 v_main_~y~0_4) (+ v_main_~x~0_23 v_main_~y~0_5)) (< v_main_~x~0_23 750001) (< v_main_~x~0_24 v_main_~x~0_23)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {345#(<= main_~x~0 750000)} is VALID [2022-04-15 06:48:33,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#(<= main_~x~0 750000)} [55] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-15 06:48:33,285 INFO L272 TraceCheckUtils]: 10: Hoare triple {339#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {339#false} is VALID [2022-04-15 06:48:33,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#false} ~cond := #in~cond; {339#false} is VALID [2022-04-15 06:48:33,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#false} assume 0 == ~cond; {339#false} is VALID [2022-04-15 06:48:33,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {339#false} assume !false; {339#false} is VALID [2022-04-15 06:48:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:33,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413090264] [2022-04-15 06:48:33,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413090264] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:33,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263631669] [2022-04-15 06:48:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:33,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:33,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:48:33,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 06:48:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:33,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:48:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:33,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:33,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {338#true} call ULTIMATE.init(); {338#true} is VALID [2022-04-15 06:48:33,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {338#true} is VALID [2022-04-15 06:48:33,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#true} assume true; {338#true} is VALID [2022-04-15 06:48:33,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} #48#return; {338#true} is VALID [2022-04-15 06:48:33,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#true} call #t~ret7 := main(); {338#true} is VALID [2022-04-15 06:48:33,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {338#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {365#(<= main_~x~0 0)} is VALID [2022-04-15 06:48:33,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {365#(<= main_~x~0 0)} [56] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and (< v_main_~x~0_22 v_main_~x~0_21) (< v_main_~x~0_21 500001)) (and (not (< v_main_~x~0_22 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_22, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {344#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:33,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#(<= main_~x~0 500000)} [57] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:33,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#(<= main_~x~0 500000)} [58] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse1 (<= 500000 v_main_~x~0_24))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) .cse0 (or (not .cse1) (not (< v_main_~x~0_24 750000))) .cse2 .cse3) (and .cse0 .cse2 .cse3 (= v_main_~y~0_5 v_main_~y~0_4)) (and .cse1 (= (+ v_main_~x~0_24 v_main_~y~0_4) (+ v_main_~x~0_23 v_main_~y~0_5)) (< v_main_~x~0_23 750001) (< v_main_~x~0_24 v_main_~x~0_23)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {345#(<= main_~x~0 750000)} is VALID [2022-04-15 06:48:33,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {345#(<= main_~x~0 750000)} [55] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-15 06:48:33,561 INFO L272 TraceCheckUtils]: 10: Hoare triple {339#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {339#false} is VALID [2022-04-15 06:48:33,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#false} ~cond := #in~cond; {339#false} is VALID [2022-04-15 06:48:33,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#false} assume 0 == ~cond; {339#false} is VALID [2022-04-15 06:48:33,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {339#false} assume !false; {339#false} is VALID [2022-04-15 06:48:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:33,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:33,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {339#false} assume !false; {339#false} is VALID [2022-04-15 06:48:33,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#false} assume 0 == ~cond; {339#false} is VALID [2022-04-15 06:48:33,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#false} ~cond := #in~cond; {339#false} is VALID [2022-04-15 06:48:33,652 INFO L272 TraceCheckUtils]: 10: Hoare triple {339#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {339#false} is VALID [2022-04-15 06:48:33,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(< main_~x~0 1000000)} [55] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {339#false} is VALID [2022-04-15 06:48:33,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {402#(< main_~x~0 1000000)} [58] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse1 (<= 500000 v_main_~x~0_24))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) .cse0 (or (not .cse1) (not (< v_main_~x~0_24 750000))) .cse2 .cse3) (and .cse0 .cse2 .cse3 (= v_main_~y~0_5 v_main_~y~0_4)) (and .cse1 (= (+ v_main_~x~0_24 v_main_~y~0_4) (+ v_main_~x~0_23 v_main_~y~0_5)) (< v_main_~x~0_23 750001) (< v_main_~x~0_24 v_main_~x~0_23)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {402#(< main_~x~0 1000000)} is VALID [2022-04-15 06:48:33,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(< main_~x~0 1000000)} [57] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#(< main_~x~0 1000000)} is VALID [2022-04-15 06:48:33,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {402#(< main_~x~0 1000000)} [56] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and (< v_main_~x~0_22 v_main_~x~0_21) (< v_main_~x~0_21 500001)) (and (not (< v_main_~x~0_22 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_22, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {402#(< main_~x~0 1000000)} is VALID [2022-04-15 06:48:33,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {338#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {402#(< main_~x~0 1000000)} is VALID [2022-04-15 06:48:33,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {338#true} call #t~ret7 := main(); {338#true} is VALID [2022-04-15 06:48:33,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {338#true} {338#true} #48#return; {338#true} is VALID [2022-04-15 06:48:33,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {338#true} assume true; {338#true} is VALID [2022-04-15 06:48:33,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {338#true} is VALID [2022-04-15 06:48:33,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {338#true} call ULTIMATE.init(); {338#true} is VALID [2022-04-15 06:48:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:33,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263631669] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:33,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:48:33,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 5] total 8 [2022-04-15 06:48:33,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417809642] [2022-04-15 06:48:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417809642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:33,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:48:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165071887] [2022-04-15 06:48:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:33,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:48:33,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:33,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:33,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:33,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:48:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:33,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:48:33,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:48:33,833 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:33,970 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-04-15 06:48:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:48:33,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:48:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 06:48:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 06:48:33,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 06:48:34,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:34,011 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:48:34,011 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:48:34,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:48:34,013 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:34,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:48:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-15 06:48:34,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:34,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:34,033 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:34,033 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:34,035 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 06:48:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:48:34,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:34,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:34,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 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 29 states. [2022-04-15 06:48:34,036 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 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 29 states. [2022-04-15 06:48:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:34,037 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-15 06:48:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-15 06:48:34,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:34,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:34,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:34,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 06:48:34,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2022-04-15 06:48:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:34,040 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 06:48:34,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:34,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 06:48:34,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 06:48:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:48:34,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:34,066 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:34,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 06:48:34,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:34,279 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1006918194, now seen corresponding path program 1 times [2022-04-15 06:48:34,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:34,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199978162] [2022-04-15 06:48:36,596 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:38,354 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:38,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:38,862 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:38,863 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1965538073, now seen corresponding path program 1 times [2022-04-15 06:48:38,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:38,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289528474] [2022-04-15 06:48:38,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:38,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:38,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:48:38,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:48:38,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {620#true} {620#true} #48#return; {620#true} is VALID [2022-04-15 06:48:38,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:38,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:48:38,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:48:38,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #48#return; {620#true} is VALID [2022-04-15 06:48:38,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret7 := main(); {620#true} is VALID [2022-04-15 06:48:38,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {625#(= main_~x~0 0)} is VALID [2022-04-15 06:48:38,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} [60] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_41 500000)) .cse1) (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 500001)))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {626#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:38,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(<= main_~x~0 500000)} [61] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:38,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {626#(<= main_~x~0 500000)} [62] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_12| |v_main_#t~post6_10|)) (.cse3 (<= 750000 v_main_~x~0_43)) (.cse1 (= v_main_~y~0_15 v_main_~y~0_14)) (.cse2 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_42 (* v_main_~y~0_15 2)) (+ v_main_~x~0_43 (* v_main_~y~0_14 2))) .cse3 (< v_main_~y~0_14 (+ v_main_~y~0_15 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (< v_main_~y~0_15 v_main_~y~0_14)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_12|} OutVars{main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {626#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:38,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#(<= main_~x~0 500000)} [63] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {626#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:38,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(<= main_~x~0 500000)} [64] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse4 (= |v_main_#t~post6_15| |v_main_#t~post6_11|)) (.cse1 (<= 500000 v_main_~x~0_45))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_45 750000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_45 v_main_~x~0_44) .cse1 (= (+ v_main_~x~0_44 v_main_~y~0_17) (+ v_main_~x~0_45 v_main_~y~0_16)) (< v_main_~x~0_44 750001)))) InVars {main_~y~0=v_main_~y~0_17, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_15|} OutVars{main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_11|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {627#(<= main_~x~0 750000)} is VALID [2022-04-15 06:48:38,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {627#(<= main_~x~0 750000)} [59] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {621#false} is VALID [2022-04-15 06:48:38,975 INFO L272 TraceCheckUtils]: 12: Hoare triple {621#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {621#false} is VALID [2022-04-15 06:48:38,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2022-04-15 06:48:38,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {621#false} assume 0 == ~cond; {621#false} is VALID [2022-04-15 06:48:38,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-15 06:48:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:38,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:38,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289528474] [2022-04-15 06:48:38,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289528474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:38,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868912570] [2022-04-15 06:48:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:38,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:38,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:38,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:48:39,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 06:48:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:39,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:48:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:39,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:39,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-15 06:48:39,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:48:39,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:48:39,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #48#return; {620#true} is VALID [2022-04-15 06:48:39,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret7 := main(); {620#true} is VALID [2022-04-15 06:48:39,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {625#(= main_~x~0 0)} is VALID [2022-04-15 06:48:39,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} [60] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_41 500000)) .cse1) (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 500001)))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:48:39,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [61] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:48:39,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [62] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_12| |v_main_#t~post6_10|)) (.cse3 (<= 750000 v_main_~x~0_43)) (.cse1 (= v_main_~y~0_15 v_main_~y~0_14)) (.cse2 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_42 (* v_main_~y~0_15 2)) (+ v_main_~x~0_43 (* v_main_~y~0_14 2))) .cse3 (< v_main_~y~0_14 (+ v_main_~y~0_15 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (< v_main_~y~0_15 v_main_~y~0_14)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_12|} OutVars{main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:48:39,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [63] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:48:39,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {650#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [64] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse4 (= |v_main_#t~post6_15| |v_main_#t~post6_11|)) (.cse1 (<= 500000 v_main_~x~0_45))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_45 750000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_45 v_main_~x~0_44) .cse1 (= (+ v_main_~x~0_44 v_main_~y~0_17) (+ v_main_~x~0_45 v_main_~y~0_16)) (< v_main_~x~0_44 750001)))) InVars {main_~y~0=v_main_~y~0_17, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_15|} OutVars{main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_11|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {663#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:48:39,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {663#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [59] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {621#false} is VALID [2022-04-15 06:48:39,299 INFO L272 TraceCheckUtils]: 12: Hoare triple {621#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {621#false} is VALID [2022-04-15 06:48:39,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2022-04-15 06:48:39,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {621#false} assume 0 == ~cond; {621#false} is VALID [2022-04-15 06:48:39,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-15 06:48:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:39,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:51,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-15 06:48:51,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {682#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {621#false} is VALID [2022-04-15 06:48:51,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {686#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {682#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:48:51,048 INFO L272 TraceCheckUtils]: 12: Hoare triple {690#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {686#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:48:51,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [59] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {690#(= main_~x~0 1000000)} is VALID [2022-04-15 06:48:51,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [64] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse4 (= |v_main_#t~post6_15| |v_main_#t~post6_11|)) (.cse1 (<= 500000 v_main_~x~0_45))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_45 750000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~x~0_45 v_main_~x~0_44) .cse1 (= (+ v_main_~x~0_44 v_main_~y~0_17) (+ v_main_~x~0_45 v_main_~y~0_16)) (< v_main_~x~0_44 750001)))) InVars {main_~y~0=v_main_~y~0_17, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_15|} OutVars{main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_11|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {694#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:48:51,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {694#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [63] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {694#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:48:51,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [62] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_12| |v_main_#t~post6_10|)) (.cse3 (<= 750000 v_main_~x~0_43)) (.cse1 (= v_main_~y~0_15 v_main_~y~0_14)) (.cse2 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_42 (* v_main_~y~0_15 2)) (+ v_main_~x~0_43 (* v_main_~y~0_14 2))) .cse3 (< v_main_~y~0_14 (+ v_main_~y~0_15 2 (div (+ 999999 (* (- 1) v_main_~x~0_43)) 2))) (< v_main_~y~0_15 v_main_~y~0_14)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_43 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_12|} OutVars{main_~y~0=v_main_~y~0_14, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {694#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:48:51,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [61] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:48:51,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [60] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_41 500000)) .cse1) (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 500001)))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {704#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:48:51,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {704#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:48:51,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret7 := main(); {620#true} is VALID [2022-04-15 06:48:51,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #48#return; {620#true} is VALID [2022-04-15 06:48:51,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:48:51,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:48:51,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-15 06:48:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:51,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868912570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:51,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:51,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:48:51,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:51,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199978162] [2022-04-15 06:48:51,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199978162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:51,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:51,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:48:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888099721] [2022-04-15 06:48:51,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:51,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:48:51,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:51,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:51,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:48:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:48:51,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:48:51,236 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:51,550 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 06:48:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:48:51,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:48:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-15 06:48:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-15 06:48:51,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-15 06:48:51,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:51,597 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:48:51,597 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:48:51,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:48:51,599 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:51,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:48:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:48:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-15 06:48:51,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:51,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,638 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,638 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:51,640 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 06:48:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 06:48:51,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:51,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:51,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 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 06:48:51,641 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 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 06:48:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:51,642 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 06:48:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 06:48:51,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:51,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:51,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:51,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 06:48:51,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 25 [2022-04-15 06:48:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:51,645 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 06:48:51,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:51,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 06:48:51,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 06:48:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:48:51,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:51,681 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:51,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:48:51,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 06:48:51,884 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 472639013, now seen corresponding path program 2 times [2022-04-15 06:48:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325444922] [2022-04-15 06:48:55,975 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:56,051 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:56,349 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:56,663 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:56,664 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1969854247, now seen corresponding path program 1 times [2022-04-15 06:48:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:56,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885698608] [2022-04-15 06:48:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:56,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {1001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {993#true} is VALID [2022-04-15 06:48:56,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {993#true} assume true; {993#true} is VALID [2022-04-15 06:48:56,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {993#true} {993#true} #48#return; {993#true} is VALID [2022-04-15 06:48:56,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {1001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:56,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {1001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {993#true} is VALID [2022-04-15 06:48:56,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2022-04-15 06:48:56,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #48#return; {993#true} is VALID [2022-04-15 06:48:56,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret7 := main(); {993#true} is VALID [2022-04-15 06:48:56,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {993#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {998#(= main_~x~0 0)} is VALID [2022-04-15 06:48:56,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {998#(= main_~x~0 0)} [66] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68))) (or (and (< v_main_~x~0_68 500001) (< v_main_~x~0_69 v_main_~x~0_68)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_69) .cse1))) InVars {main_~x~0=v_main_~x~0_69, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_68, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:56,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {999#(<= main_~x~0 500000)} [67] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:56,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {999#(<= main_~x~0 500000)} [68] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_71)) (.cse1 (= |v_main_#t~post6_25| |v_main_#t~post6_23|)) (.cse2 (= v_main_~y~0_33 v_main_~y~0_32))) (or (and (< v_main_~y~0_33 v_main_~y~0_32) (= (+ (* v_main_~y~0_33 2) v_main_~x~0_70) (+ v_main_~x~0_71 (* v_main_~y~0_32 2))) (< v_main_~y~0_32 (+ v_main_~y~0_33 2 (div (+ (* (- 1) v_main_~x~0_71) 999999) 2))) .cse0) (and (= v_main_~x~0_71 v_main_~x~0_70) .cse1 .cse2) (and (or (not (< v_main_~x~0_71 1000000)) (not .cse0)) (= v_main_~x~0_70 v_main_~x~0_71) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_33, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_32, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:56,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#(<= main_~x~0 500000)} [69] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:56,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#(<= main_~x~0 500000)} [70] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_73)) (.cse1 (= |v_main_#t~post6_28| |v_main_#t~post6_24|)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72)) (.cse3 (= v_main_~y~0_35 v_main_~y~0_34))) (or (and (< v_main_~x~0_72 750001) (= (+ v_main_~x~0_72 v_main_~y~0_35) (+ v_main_~x~0_73 v_main_~y~0_34)) .cse0 (< v_main_~x~0_73 v_main_~x~0_72)) (and .cse1 .cse2 (= |v_main_#t~post5_17| |v_main_#t~post5_16|) .cse3) (and (or (not (< v_main_~x~0_73 750000)) (not .cse0)) .cse1 .cse2 (= |v_main_#t~post5_16| |v_main_#t~post5_17|) .cse3))) InVars {main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_28|} OutVars{main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_16|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1000#(<= main_~x~0 750000)} is VALID [2022-04-15 06:48:56,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#(<= main_~x~0 750000)} [65] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {994#false} is VALID [2022-04-15 06:48:56,745 INFO L272 TraceCheckUtils]: 12: Hoare triple {994#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {994#false} is VALID [2022-04-15 06:48:56,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {994#false} ~cond := #in~cond; {994#false} is VALID [2022-04-15 06:48:56,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {994#false} assume 0 == ~cond; {994#false} is VALID [2022-04-15 06:48:56,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#false} assume !false; {994#false} is VALID [2022-04-15 06:48:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:56,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:56,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885698608] [2022-04-15 06:48:56,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885698608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:56,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722882064] [2022-04-15 06:48:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:56,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:56,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:56,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:48:56,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 06:48:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:48:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:57,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {993#true} is VALID [2022-04-15 06:48:57,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {993#true} is VALID [2022-04-15 06:48:57,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2022-04-15 06:48:57,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #48#return; {993#true} is VALID [2022-04-15 06:48:57,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret7 := main(); {993#true} is VALID [2022-04-15 06:48:57,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {993#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1020#(<= main_~x~0 0)} is VALID [2022-04-15 06:48:57,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#(<= main_~x~0 0)} [66] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68))) (or (and (< v_main_~x~0_68 500001) (< v_main_~x~0_69 v_main_~x~0_68)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_69) .cse1))) InVars {main_~x~0=v_main_~x~0_69, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_68, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:57,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {999#(<= main_~x~0 500000)} [67] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:57,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {999#(<= main_~x~0 500000)} [68] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_71)) (.cse1 (= |v_main_#t~post6_25| |v_main_#t~post6_23|)) (.cse2 (= v_main_~y~0_33 v_main_~y~0_32))) (or (and (< v_main_~y~0_33 v_main_~y~0_32) (= (+ (* v_main_~y~0_33 2) v_main_~x~0_70) (+ v_main_~x~0_71 (* v_main_~y~0_32 2))) (< v_main_~y~0_32 (+ v_main_~y~0_33 2 (div (+ (* (- 1) v_main_~x~0_71) 999999) 2))) .cse0) (and (= v_main_~x~0_71 v_main_~x~0_70) .cse1 .cse2) (and (or (not (< v_main_~x~0_71 1000000)) (not .cse0)) (= v_main_~x~0_70 v_main_~x~0_71) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_33, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_32, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:57,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {999#(<= main_~x~0 500000)} [69] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {999#(<= main_~x~0 500000)} is VALID [2022-04-15 06:48:57,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {999#(<= main_~x~0 500000)} [70] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_73)) (.cse1 (= |v_main_#t~post6_28| |v_main_#t~post6_24|)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72)) (.cse3 (= v_main_~y~0_35 v_main_~y~0_34))) (or (and (< v_main_~x~0_72 750001) (= (+ v_main_~x~0_72 v_main_~y~0_35) (+ v_main_~x~0_73 v_main_~y~0_34)) .cse0 (< v_main_~x~0_73 v_main_~x~0_72)) (and .cse1 .cse2 (= |v_main_#t~post5_17| |v_main_#t~post5_16|) .cse3) (and (or (not (< v_main_~x~0_73 750000)) (not .cse0)) .cse1 .cse2 (= |v_main_#t~post5_16| |v_main_#t~post5_17|) .cse3))) InVars {main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_28|} OutVars{main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_16|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1000#(<= main_~x~0 750000)} is VALID [2022-04-15 06:48:57,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#(<= main_~x~0 750000)} [65] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {994#false} is VALID [2022-04-15 06:48:57,007 INFO L272 TraceCheckUtils]: 12: Hoare triple {994#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {994#false} is VALID [2022-04-15 06:48:57,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {994#false} ~cond := #in~cond; {994#false} is VALID [2022-04-15 06:48:57,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {994#false} assume 0 == ~cond; {994#false} is VALID [2022-04-15 06:48:57,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#false} assume !false; {994#false} is VALID [2022-04-15 06:48:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:57,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:05,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#false} assume !false; {994#false} is VALID [2022-04-15 06:49:05,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {994#false} is VALID [2022-04-15 06:49:05,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {1058#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1054#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:05,908 INFO L272 TraceCheckUtils]: 12: Hoare triple {1062#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1058#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:49:05,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1066#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [65] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1062#(= main_~x~0 1000000)} is VALID [2022-04-15 06:49:05,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {1066#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [70] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_73)) (.cse1 (= |v_main_#t~post6_28| |v_main_#t~post6_24|)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72)) (.cse3 (= v_main_~y~0_35 v_main_~y~0_34))) (or (and (< v_main_~x~0_72 750001) (= (+ v_main_~x~0_72 v_main_~y~0_35) (+ v_main_~x~0_73 v_main_~y~0_34)) .cse0 (< v_main_~x~0_73 v_main_~x~0_72)) (and .cse1 .cse2 (= |v_main_#t~post5_17| |v_main_#t~post5_16|) .cse3) (and (or (not (< v_main_~x~0_73 750000)) (not .cse0)) .cse1 .cse2 (= |v_main_#t~post5_16| |v_main_#t~post5_17|) .cse3))) InVars {main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_28|} OutVars{main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_16|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1066#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:05,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [69] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1066#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:05,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1076#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [68] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_71)) (.cse1 (= |v_main_#t~post6_25| |v_main_#t~post6_23|)) (.cse2 (= v_main_~y~0_33 v_main_~y~0_32))) (or (and (< v_main_~y~0_33 v_main_~y~0_32) (= (+ (* v_main_~y~0_33 2) v_main_~x~0_70) (+ v_main_~x~0_71 (* v_main_~y~0_32 2))) (< v_main_~y~0_32 (+ v_main_~y~0_33 2 (div (+ (* (- 1) v_main_~x~0_71) 999999) 2))) .cse0) (and (= v_main_~x~0_71 v_main_~x~0_70) .cse1 .cse2) (and (or (not (< v_main_~x~0_71 1000000)) (not .cse0)) (= v_main_~x~0_70 v_main_~x~0_71) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_33, main_~x~0=v_main_~x~0_71, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_32, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1066#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:05,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {1076#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [67] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1076#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:49:05,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {1076#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [66] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68))) (or (and (< v_main_~x~0_68 500001) (< v_main_~x~0_69 v_main_~x~0_68)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_69) .cse1))) InVars {main_~x~0=v_main_~x~0_69, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_68, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1076#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:49:05,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {993#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1076#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:49:05,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret7 := main(); {993#true} is VALID [2022-04-15 06:49:05,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #48#return; {993#true} is VALID [2022-04-15 06:49:05,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2022-04-15 06:49:05,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {993#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {993#true} is VALID [2022-04-15 06:49:05,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {993#true} is VALID [2022-04-15 06:49:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722882064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:05,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:49:06,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:06,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325444922] [2022-04-15 06:49:06,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325444922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:06,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:06,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:49:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813377328] [2022-04-15 06:49:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:49:06,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:06,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:06,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:49:06,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:06,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:49:06,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:49:06,138 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:06,518 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-15 06:49:06,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:49:06,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:49:06,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-15 06:49:06,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2022-04-15 06:49:06,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2022-04-15 06:49:06,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:06,565 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:49:06,565 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:49:06,566 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:49:06,567 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:06,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:49:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:49:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-15 06:49:06,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:06,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,625 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,625 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:06,627 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-15 06:49:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 06:49:06,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:06,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:06,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 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 41 states. [2022-04-15 06:49:06,628 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 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 41 states. [2022-04-15 06:49:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:06,633 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-15 06:49:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 06:49:06,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:06,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:06,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:06,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-15 06:49:06,637 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2022-04-15 06:49:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:06,637 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-15 06:49:06,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:06,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-15 06:49:06,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:06,681 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 06:49:06,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:49:06,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:06,681 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:06,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:06,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:06,882 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:06,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:06,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1728455420, now seen corresponding path program 3 times [2022-04-15 06:49:06,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:06,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935113029] [2022-04-15 06:49:07,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:07,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:07,567 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:07,568 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1610279271, now seen corresponding path program 1 times [2022-04-15 06:49:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412947568] [2022-04-15 06:49:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:07,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:07,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1393#true} is VALID [2022-04-15 06:49:07,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} assume true; {1393#true} is VALID [2022-04-15 06:49:07,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1393#true} {1393#true} #48#return; {1393#true} is VALID [2022-04-15 06:49:07,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {1393#true} call ULTIMATE.init(); {1404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:07,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1393#true} is VALID [2022-04-15 06:49:07,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} assume true; {1393#true} is VALID [2022-04-15 06:49:07,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1393#true} #48#return; {1393#true} is VALID [2022-04-15 06:49:07,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#true} call #t~ret7 := main(); {1393#true} is VALID [2022-04-15 06:49:07,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1398#(= main_~x~0 0)} is VALID [2022-04-15 06:49:07,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {1398#(= main_~x~0 0)} [72] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_98 v_main_~x~0_97))) (or (and .cse0 (= |v_main_#t~post4_30| |v_main_#t~post4_29|)) (and (< v_main_~x~0_98 v_main_~x~0_97) (< v_main_~x~0_97 500001)) (and .cse0 (= |v_main_#t~post4_29| |v_main_#t~post4_30|) (not (< v_main_~x~0_98 500000))))) InVars {main_~x~0=v_main_~x~0_98, main_#t~post4=|v_main_#t~post4_30|} OutVars{main_~x~0=v_main_~x~0_97, main_#t~post4=|v_main_#t~post4_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1399#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:07,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {1399#(<= main_~x~0 500000)} [73] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:07,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#(<= main_~x~0 500000)} [74] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_100)) (.cse1 (= |v_main_#t~post6_38| |v_main_#t~post6_36|)) (.cse2 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse3 (= v_main_~x~0_100 v_main_~x~0_99))) (or (and (or (not .cse0) (not (< v_main_~x~0_100 1000000))) .cse1 .cse2 .cse3) (and .cse0 (< v_main_~y~0_51 (+ v_main_~y~0_52 2 (div (+ 999999 (* v_main_~x~0_100 (- 1))) 2))) (= (+ v_main_~x~0_100 (* v_main_~y~0_51 2)) (+ v_main_~x~0_99 (* v_main_~y~0_52 2))) (< v_main_~y~0_52 v_main_~y~0_51)) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_~x~0=v_main_~x~0_100, main_#t~post6=|v_main_#t~post6_38|} OutVars{main_~y~0=v_main_~y~0_51, main_~x~0=v_main_~x~0_99, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1400#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:49:07,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {1400#(<= main_~x~0 1000000)} [75] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1400#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:49:07,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(<= main_~x~0 1000000)} [76] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse1 (= |v_main_#t~post5_23| |v_main_#t~post5_22|)) (.cse2 (= v_main_~x~0_102 v_main_~x~0_101)) (.cse4 (<= 500000 v_main_~x~0_102)) (.cse3 (= |v_main_#t~post6_41| |v_main_#t~post6_37|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_102 v_main_~y~0_53))) (and .cse4 (= (+ v_main_~x~0_101 v_main_~y~0_54) .cse5) (< v_main_~y~0_54 v_main_~y~0_53) (< .cse5 (+ 750001 v_main_~y~0_54)))) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_102 750000))) .cse3))) InVars {main_~y~0=v_main_~y~0_54, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_102, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_22|, main_~x~0=v_main_~x~0_101, main_#t~post6=|v_main_#t~post6_37|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1400#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:49:07,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1400#(<= main_~x~0 1000000)} [71] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1401#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} is VALID [2022-04-15 06:49:07,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {1401#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1402#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:49:07,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1402#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1403#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:07,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1403#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1394#false} is VALID [2022-04-15 06:49:07,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#false} assume !false; {1394#false} is VALID [2022-04-15 06:49:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:49:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412947568] [2022-04-15 06:49:07,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412947568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9740643] [2022-04-15 06:49:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:07,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:07,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:07,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:07,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 06:49:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:07,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:07,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:07,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {1393#true} call ULTIMATE.init(); {1393#true} is VALID [2022-04-15 06:49:07,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1393#true} is VALID [2022-04-15 06:49:07,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} assume true; {1393#true} is VALID [2022-04-15 06:49:07,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1393#true} #48#return; {1393#true} is VALID [2022-04-15 06:49:07,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#true} call #t~ret7 := main(); {1393#true} is VALID [2022-04-15 06:49:07,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1423#(<= main_~x~0 0)} is VALID [2022-04-15 06:49:07,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {1423#(<= main_~x~0 0)} [72] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_98 v_main_~x~0_97))) (or (and .cse0 (= |v_main_#t~post4_30| |v_main_#t~post4_29|)) (and (< v_main_~x~0_98 v_main_~x~0_97) (< v_main_~x~0_97 500001)) (and .cse0 (= |v_main_#t~post4_29| |v_main_#t~post4_30|) (not (< v_main_~x~0_98 500000))))) InVars {main_~x~0=v_main_~x~0_98, main_#t~post4=|v_main_#t~post4_30|} OutVars{main_~x~0=v_main_~x~0_97, main_#t~post4=|v_main_#t~post4_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1399#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:07,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {1399#(<= main_~x~0 500000)} [73] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:07,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {1399#(<= main_~x~0 500000)} [74] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_100)) (.cse1 (= |v_main_#t~post6_38| |v_main_#t~post6_36|)) (.cse2 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse3 (= v_main_~x~0_100 v_main_~x~0_99))) (or (and (or (not .cse0) (not (< v_main_~x~0_100 1000000))) .cse1 .cse2 .cse3) (and .cse0 (< v_main_~y~0_51 (+ v_main_~y~0_52 2 (div (+ 999999 (* v_main_~x~0_100 (- 1))) 2))) (= (+ v_main_~x~0_100 (* v_main_~y~0_51 2)) (+ v_main_~x~0_99 (* v_main_~y~0_52 2))) (< v_main_~y~0_52 v_main_~y~0_51)) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_~x~0=v_main_~x~0_100, main_#t~post6=|v_main_#t~post6_38|} OutVars{main_~y~0=v_main_~y~0_51, main_~x~0=v_main_~x~0_99, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1399#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:07,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {1399#(<= main_~x~0 500000)} [75] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1399#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:07,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {1399#(<= main_~x~0 500000)} [76] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse1 (= |v_main_#t~post5_23| |v_main_#t~post5_22|)) (.cse2 (= v_main_~x~0_102 v_main_~x~0_101)) (.cse4 (<= 500000 v_main_~x~0_102)) (.cse3 (= |v_main_#t~post6_41| |v_main_#t~post6_37|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_102 v_main_~y~0_53))) (and .cse4 (= (+ v_main_~x~0_101 v_main_~y~0_54) .cse5) (< v_main_~y~0_54 v_main_~y~0_53) (< .cse5 (+ 750001 v_main_~y~0_54)))) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_102 750000))) .cse3))) InVars {main_~y~0=v_main_~y~0_54, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_102, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_22|, main_~x~0=v_main_~x~0_101, main_#t~post6=|v_main_#t~post6_37|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1439#(< main_~x~0 750001)} is VALID [2022-04-15 06:49:07,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {1439#(< main_~x~0 750001)} [71] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1394#false} is VALID [2022-04-15 06:49:07,920 INFO L272 TraceCheckUtils]: 12: Hoare triple {1394#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1394#false} is VALID [2022-04-15 06:49:07,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {1394#false} ~cond := #in~cond; {1394#false} is VALID [2022-04-15 06:49:07,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {1394#false} assume 0 == ~cond; {1394#false} is VALID [2022-04-15 06:49:07,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#false} assume !false; {1394#false} is VALID [2022-04-15 06:49:07,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:07,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:08,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1394#false} assume !false; {1394#false} is VALID [2022-04-15 06:49:08,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {1458#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1394#false} is VALID [2022-04-15 06:49:08,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {1462#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1458#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:08,319 INFO L272 TraceCheckUtils]: 12: Hoare triple {1401#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1462#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:49:08,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {1400#(<= main_~x~0 1000000)} [71] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1401#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} is VALID [2022-04-15 06:49:08,321 INFO L290 TraceCheckUtils]: 10: Hoare triple {1400#(<= main_~x~0 1000000)} [76] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_54 v_main_~y~0_53)) (.cse1 (= |v_main_#t~post5_23| |v_main_#t~post5_22|)) (.cse2 (= v_main_~x~0_102 v_main_~x~0_101)) (.cse4 (<= 500000 v_main_~x~0_102)) (.cse3 (= |v_main_#t~post6_41| |v_main_#t~post6_37|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_102 v_main_~y~0_53))) (and .cse4 (= (+ v_main_~x~0_101 v_main_~y~0_54) .cse5) (< v_main_~y~0_54 v_main_~y~0_53) (< .cse5 (+ 750001 v_main_~y~0_54)))) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_102 750000))) .cse3))) InVars {main_~y~0=v_main_~y~0_54, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_102, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_22|, main_~x~0=v_main_~x~0_101, main_#t~post6=|v_main_#t~post6_37|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1400#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:49:08,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1400#(<= main_~x~0 1000000)} [75] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1400#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:49:08,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {1478#(and (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))) (<= main_~x~0 1000000))} [74] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_100)) (.cse1 (= |v_main_#t~post6_38| |v_main_#t~post6_36|)) (.cse2 (= v_main_~y~0_52 v_main_~y~0_51)) (.cse3 (= v_main_~x~0_100 v_main_~x~0_99))) (or (and (or (not .cse0) (not (< v_main_~x~0_100 1000000))) .cse1 .cse2 .cse3) (and .cse0 (< v_main_~y~0_51 (+ v_main_~y~0_52 2 (div (+ 999999 (* v_main_~x~0_100 (- 1))) 2))) (= (+ v_main_~x~0_100 (* v_main_~y~0_51 2)) (+ v_main_~x~0_99 (* v_main_~y~0_52 2))) (< v_main_~y~0_52 v_main_~y~0_51)) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_52, main_~x~0=v_main_~x~0_100, main_#t~post6=|v_main_#t~post6_38|} OutVars{main_~y~0=v_main_~y~0_51, main_~x~0=v_main_~x~0_99, main_#t~post6=|v_main_#t~post6_36|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1400#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:49:08,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {1478#(and (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))) (<= main_~x~0 1000000))} [73] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1478#(and (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))) (<= main_~x~0 1000000))} is VALID [2022-04-15 06:49:08,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {1478#(and (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))) (<= main_~x~0 1000000))} [72] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_98 v_main_~x~0_97))) (or (and .cse0 (= |v_main_#t~post4_30| |v_main_#t~post4_29|)) (and (< v_main_~x~0_98 v_main_~x~0_97) (< v_main_~x~0_97 500001)) (and .cse0 (= |v_main_#t~post4_29| |v_main_#t~post4_30|) (not (< v_main_~x~0_98 500000))))) InVars {main_~x~0=v_main_~x~0_98, main_#t~post4=|v_main_#t~post4_30|} OutVars{main_~x~0=v_main_~x~0_97, main_#t~post4=|v_main_#t~post4_29|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1478#(and (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))) (<= main_~x~0 1000000))} is VALID [2022-04-15 06:49:08,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {1393#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1478#(and (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))) (<= main_~x~0 1000000))} is VALID [2022-04-15 06:49:08,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {1393#true} call #t~ret7 := main(); {1393#true} is VALID [2022-04-15 06:49:08,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1393#true} #48#return; {1393#true} is VALID [2022-04-15 06:49:08,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {1393#true} assume true; {1393#true} is VALID [2022-04-15 06:49:08,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1393#true} is VALID [2022-04-15 06:49:08,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {1393#true} call ULTIMATE.init(); {1393#true} is VALID [2022-04-15 06:49:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:08,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9740643] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:08,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:08,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 7] total 14 [2022-04-15 06:49:08,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935113029] [2022-04-15 06:49:08,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935113029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:08,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:08,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:49:08,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847957210] [2022-04-15 06:49:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:08,583 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:49:08,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:08,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:08,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:08,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:49:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:08,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:49:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:49:08,610 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:09,179 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-04-15 06:49:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:49:09,180 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:49:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-15 06:49:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-15 06:49:09,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-15 06:49:09,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:09,231 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:49:09,231 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:49:09,231 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:49:09,232 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:09,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 63 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:49:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:49:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-04-15 06:49:09,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:09,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,301 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,301 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:09,302 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 06:49:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 06:49:09,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:09,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:09,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 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 45 states. [2022-04-15 06:49:09,303 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 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 45 states. [2022-04-15 06:49:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:09,304 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 06:49:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 06:49:09,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:09,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:09,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:09,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-15 06:49:09,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 33 [2022-04-15 06:49:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:09,306 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-15 06:49:09,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:09,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-15 06:49:09,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-15 06:49:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:49:09,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:09,368 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:09,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:09,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:09,568 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 238558291, now seen corresponding path program 4 times [2022-04-15 06:49:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:09,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [25972647] [2022-04-15 06:49:09,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:12,811 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:12,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:13,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:13,176 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1250704295, now seen corresponding path program 1 times [2022-04-15 06:49:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:13,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080612468] [2022-04-15 06:49:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:13,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {1830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1822#true} is VALID [2022-04-15 06:49:13,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 06:49:13,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1822#true} {1822#true} #48#return; {1822#true} is VALID [2022-04-15 06:49:13,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:13,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1822#true} is VALID [2022-04-15 06:49:13,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 06:49:13,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #48#return; {1822#true} is VALID [2022-04-15 06:49:13,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret7 := main(); {1822#true} is VALID [2022-04-15 06:49:13,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1827#(= main_~x~0 0)} is VALID [2022-04-15 06:49:13,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#(= main_~x~0 0)} [78] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_128 v_main_~x~0_127)) (.cse1 (= |v_main_#t~post4_37| |v_main_#t~post4_36|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_128 500000))) (and (< v_main_~x~0_127 500001) (< v_main_~x~0_128 v_main_~x~0_127)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_128, main_#t~post4=|v_main_#t~post4_37|} OutVars{main_~x~0=v_main_~x~0_127, main_#t~post4=|v_main_#t~post4_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1828#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:13,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#(<= main_~x~0 500000)} [79] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:13,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= main_~x~0 500000)} [80] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_130))) (or (and .cse0 (= (+ v_main_~x~0_129 (* v_main_~y~0_72 2)) (+ v_main_~x~0_130 (* v_main_~y~0_71 2))) (< v_main_~y~0_71 (+ v_main_~y~0_72 (div (+ 999999 (* v_main_~x~0_130 (- 1))) 2) 2)) (< v_main_~y~0_72 v_main_~y~0_71)) (and (= |v_main_#t~post6_51| |v_main_#t~post6_49|) (= v_main_~x~0_130 v_main_~x~0_129) (= v_main_~y~0_72 v_main_~y~0_71)) (and (= v_main_~x~0_129 v_main_~x~0_130) (= v_main_~y~0_71 v_main_~y~0_72) (or (not .cse0) (not (< v_main_~x~0_130 1000000))) (= |v_main_#t~post6_49| |v_main_#t~post6_51|)))) InVars {main_~y~0=v_main_~y~0_72, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_71, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1829#(<= main_~x~0 999999)} is VALID [2022-04-15 06:49:13,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#(<= main_~x~0 999999)} [81] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1829#(<= main_~x~0 999999)} is VALID [2022-04-15 06:49:13,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(<= main_~x~0 999999)} [82] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_132)) (.cse1 (= |v_main_#t~post6_54| |v_main_#t~post6_50|)) (.cse2 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse3 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and .cse0 (< v_main_~x~0_131 750001) (= (+ v_main_~x~0_132 v_main_~y~0_73) (+ v_main_~x~0_131 v_main_~y~0_74)) (< v_main_~x~0_132 v_main_~x~0_131)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_132 750000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_73, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1829#(<= main_~x~0 999999)} is VALID [2022-04-15 06:49:13,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(<= main_~x~0 999999)} [77] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1823#false} is VALID [2022-04-15 06:49:13,250 INFO L272 TraceCheckUtils]: 12: Hoare triple {1823#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1823#false} is VALID [2022-04-15 06:49:13,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 06:49:13,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 06:49:13,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 06:49:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:49:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080612468] [2022-04-15 06:49:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080612468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421538708] [2022-04-15 06:49:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:13,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:13,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:13,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:13,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:49:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:13,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:13,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:13,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-15 06:49:13,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1822#true} is VALID [2022-04-15 06:49:13,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 06:49:13,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #48#return; {1822#true} is VALID [2022-04-15 06:49:13,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret7 := main(); {1822#true} is VALID [2022-04-15 06:49:13,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1849#(<= main_~x~0 0)} is VALID [2022-04-15 06:49:13,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {1849#(<= main_~x~0 0)} [78] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_128 v_main_~x~0_127)) (.cse1 (= |v_main_#t~post4_37| |v_main_#t~post4_36|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_128 500000))) (and (< v_main_~x~0_127 500001) (< v_main_~x~0_128 v_main_~x~0_127)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_128, main_#t~post4=|v_main_#t~post4_37|} OutVars{main_~x~0=v_main_~x~0_127, main_#t~post4=|v_main_#t~post4_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1828#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:13,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1828#(<= main_~x~0 500000)} [79] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:13,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= main_~x~0 500000)} [80] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_130))) (or (and .cse0 (= (+ v_main_~x~0_129 (* v_main_~y~0_72 2)) (+ v_main_~x~0_130 (* v_main_~y~0_71 2))) (< v_main_~y~0_71 (+ v_main_~y~0_72 (div (+ 999999 (* v_main_~x~0_130 (- 1))) 2) 2)) (< v_main_~y~0_72 v_main_~y~0_71)) (and (= |v_main_#t~post6_51| |v_main_#t~post6_49|) (= v_main_~x~0_130 v_main_~x~0_129) (= v_main_~y~0_72 v_main_~y~0_71)) (and (= v_main_~x~0_129 v_main_~x~0_130) (= v_main_~y~0_71 v_main_~y~0_72) (or (not .cse0) (not (< v_main_~x~0_130 1000000))) (= |v_main_#t~post6_49| |v_main_#t~post6_51|)))) InVars {main_~y~0=v_main_~y~0_72, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_71, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1828#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:13,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#(<= main_~x~0 500000)} [81] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1828#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:13,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {1828#(<= main_~x~0 500000)} [82] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_132)) (.cse1 (= |v_main_#t~post6_54| |v_main_#t~post6_50|)) (.cse2 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse3 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and .cse0 (< v_main_~x~0_131 750001) (= (+ v_main_~x~0_132 v_main_~y~0_73) (+ v_main_~x~0_131 v_main_~y~0_74)) (< v_main_~x~0_132 v_main_~x~0_131)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_132 750000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_73, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1865#(< main_~x~0 750001)} is VALID [2022-04-15 06:49:13,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {1865#(< main_~x~0 750001)} [77] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1823#false} is VALID [2022-04-15 06:49:13,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {1823#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1823#false} is VALID [2022-04-15 06:49:13,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 06:49:13,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 06:49:13,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 06:49:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:13,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:24,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 06:49:24,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {1884#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 06:49:24,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1888#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1884#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:24,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {1892#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {1888#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:49:24,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {1896#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [77] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {1892#(= main_~x~0 1000000)} is VALID [2022-04-15 06:49:24,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {1896#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [82] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_132)) (.cse1 (= |v_main_#t~post6_54| |v_main_#t~post6_50|)) (.cse2 (= v_main_~y~0_74 v_main_~y~0_73)) (.cse3 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and .cse0 (< v_main_~x~0_131 750001) (= (+ v_main_~x~0_132 v_main_~y~0_73) (+ v_main_~x~0_131 v_main_~y~0_74)) (< v_main_~x~0_132 v_main_~x~0_131)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_132 750000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_73, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1896#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:24,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [81] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1896#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:24,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1906#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [80] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_130))) (or (and .cse0 (= (+ v_main_~x~0_129 (* v_main_~y~0_72 2)) (+ v_main_~x~0_130 (* v_main_~y~0_71 2))) (< v_main_~y~0_71 (+ v_main_~y~0_72 (div (+ 999999 (* v_main_~x~0_130 (- 1))) 2) 2)) (< v_main_~y~0_72 v_main_~y~0_71)) (and (= |v_main_#t~post6_51| |v_main_#t~post6_49|) (= v_main_~x~0_130 v_main_~x~0_129) (= v_main_~y~0_72 v_main_~y~0_71)) (and (= v_main_~x~0_129 v_main_~x~0_130) (= v_main_~y~0_71 v_main_~y~0_72) (or (not .cse0) (not (< v_main_~x~0_130 1000000))) (= |v_main_#t~post6_49| |v_main_#t~post6_51|)))) InVars {main_~y~0=v_main_~y~0_72, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_71, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {1896#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:24,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {1906#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [79] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1906#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:49:24,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {1906#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [78] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_128 v_main_~x~0_127)) (.cse1 (= |v_main_#t~post4_37| |v_main_#t~post4_36|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_128 500000))) (and (< v_main_~x~0_127 500001) (< v_main_~x~0_128 v_main_~x~0_127)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_128, main_#t~post4=|v_main_#t~post4_37|} OutVars{main_~x~0=v_main_~x~0_127, main_#t~post4=|v_main_#t~post4_36|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1906#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:49:24,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1906#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:49:24,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret7 := main(); {1822#true} is VALID [2022-04-15 06:49:24,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #48#return; {1822#true} is VALID [2022-04-15 06:49:24,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 06:49:24,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1822#true} is VALID [2022-04-15 06:49:24,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-15 06:49:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:24,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421538708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:24,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:24,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:49:25,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:25,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [25972647] [2022-04-15 06:49:25,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [25972647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:25,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:25,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:49:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982633321] [2022-04-15 06:49:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:25,118 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:49:25,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:25,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:25,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:49:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:49:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:49:25,148 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:25,726 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-04-15 06:49:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:49:25,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:49:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-15 06:49:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2022-04-15 06:49:25,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2022-04-15 06:49:25,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:25,784 INFO L225 Difference]: With dead ends: 67 [2022-04-15 06:49:25,785 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 06:49:25,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:49:25,788 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:25,789 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:49:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 06:49:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-15 06:49:25,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:25,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,882 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,883 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:25,884 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 06:49:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 06:49:25,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:25,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:25,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 06:49:25,885 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 06:49:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:25,886 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 06:49:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2022-04-15 06:49:25,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:25,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:25,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:25,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-15 06:49:25,888 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 37 [2022-04-15 06:49:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:25,888 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-15 06:49:25,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:25,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-15 06:49:25,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 06:49:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:49:25,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:25,937 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:25,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:26,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:26,144 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:26,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:26,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1854902826, now seen corresponding path program 5 times [2022-04-15 06:49:26,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:26,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287282811] [2022-04-15 06:49:28,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:28,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:28,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:28,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 891129319, now seen corresponding path program 1 times [2022-04-15 06:49:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:28,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847945122] [2022-04-15 06:49:28,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:28,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:28,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:28,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {2285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2277#true} is VALID [2022-04-15 06:49:28,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2277#true} assume true; {2277#true} is VALID [2022-04-15 06:49:28,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2277#true} {2277#true} #48#return; {2277#true} is VALID [2022-04-15 06:49:28,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {2277#true} call ULTIMATE.init(); {2285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:28,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {2285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2277#true} is VALID [2022-04-15 06:49:28,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {2277#true} assume true; {2277#true} is VALID [2022-04-15 06:49:28,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2277#true} {2277#true} #48#return; {2277#true} is VALID [2022-04-15 06:49:28,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {2277#true} call #t~ret7 := main(); {2277#true} is VALID [2022-04-15 06:49:28,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {2277#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2282#(= main_~x~0 0)} is VALID [2022-04-15 06:49:28,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {2282#(= main_~x~0 0)} [84] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_44| |v_main_#t~post4_43|)) (.cse1 (= v_main_~x~0_159 v_main_~x~0_158))) (or (and (< v_main_~x~0_159 v_main_~x~0_158) (< v_main_~x~0_158 500001)) (and .cse0 (not (< v_main_~x~0_159 500000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_159, main_#t~post4=|v_main_#t~post4_44|} OutVars{main_~x~0=v_main_~x~0_158, main_#t~post4=|v_main_#t~post4_43|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:28,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {2283#(<= main_~x~0 500000)} [85] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:28,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {2283#(<= main_~x~0 500000)} [86] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_161)) (.cse1 (= v_main_~y~0_93 v_main_~y~0_92)) (.cse2 (= v_main_~x~0_161 v_main_~x~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_62|))) (or (and (< v_main_~y~0_92 (+ v_main_~y~0_93 (div (+ 999999 (* v_main_~x~0_161 (- 1))) 2) 2)) (< v_main_~y~0_93 v_main_~y~0_92) (= (+ v_main_~x~0_161 (* v_main_~y~0_92 2)) (+ v_main_~x~0_160 (* v_main_~y~0_93 2))) .cse0) (and (or (not .cse0) (not (< v_main_~x~0_161 1000000))) .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_93, main_~x~0=v_main_~x~0_161, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_92, main_~x~0=v_main_~x~0_160, main_#t~post6=|v_main_#t~post6_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:28,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {2283#(<= main_~x~0 500000)} [87] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:28,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {2283#(<= main_~x~0 500000)} [88] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_163)) (.cse2 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse3 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse4 (= v_main_~x~0_163 v_main_~x~0_162)) (.cse5 (= |v_main_#t~post6_67| |v_main_#t~post6_63|))) (or (let ((.cse0 (+ v_main_~x~0_163 v_main_~y~0_94))) (and (= (+ v_main_~x~0_162 v_main_~y~0_95) .cse0) (< .cse0 (+ 750001 v_main_~y~0_95)) (< v_main_~y~0_95 v_main_~y~0_94) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_163 750000)) (not .cse1))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_163, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_162, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2284#(<= main_~x~0 750000)} is VALID [2022-04-15 06:49:28,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {2284#(<= main_~x~0 750000)} [83] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {2278#false} is VALID [2022-04-15 06:49:28,907 INFO L272 TraceCheckUtils]: 12: Hoare triple {2278#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {2278#false} is VALID [2022-04-15 06:49:28,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {2278#false} ~cond := #in~cond; {2278#false} is VALID [2022-04-15 06:49:28,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#false} assume 0 == ~cond; {2278#false} is VALID [2022-04-15 06:49:28,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#false} assume !false; {2278#false} is VALID [2022-04-15 06:49:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:28,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847945122] [2022-04-15 06:49:28,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847945122] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:28,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974574886] [2022-04-15 06:49:28,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:28,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:28,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:28,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 06:49:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:28,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:28,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:29,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {2277#true} call ULTIMATE.init(); {2277#true} is VALID [2022-04-15 06:49:29,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {2277#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2277#true} is VALID [2022-04-15 06:49:29,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {2277#true} assume true; {2277#true} is VALID [2022-04-15 06:49:29,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2277#true} {2277#true} #48#return; {2277#true} is VALID [2022-04-15 06:49:29,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {2277#true} call #t~ret7 := main(); {2277#true} is VALID [2022-04-15 06:49:29,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {2277#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2304#(<= main_~x~0 0)} is VALID [2022-04-15 06:49:29,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {2304#(<= main_~x~0 0)} [84] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_44| |v_main_#t~post4_43|)) (.cse1 (= v_main_~x~0_159 v_main_~x~0_158))) (or (and (< v_main_~x~0_159 v_main_~x~0_158) (< v_main_~x~0_158 500001)) (and .cse0 (not (< v_main_~x~0_159 500000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_159, main_#t~post4=|v_main_#t~post4_44|} OutVars{main_~x~0=v_main_~x~0_158, main_#t~post4=|v_main_#t~post4_43|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:29,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {2283#(<= main_~x~0 500000)} [85] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:29,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {2283#(<= main_~x~0 500000)} [86] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_161)) (.cse1 (= v_main_~y~0_93 v_main_~y~0_92)) (.cse2 (= v_main_~x~0_161 v_main_~x~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_62|))) (or (and (< v_main_~y~0_92 (+ v_main_~y~0_93 (div (+ 999999 (* v_main_~x~0_161 (- 1))) 2) 2)) (< v_main_~y~0_93 v_main_~y~0_92) (= (+ v_main_~x~0_161 (* v_main_~y~0_92 2)) (+ v_main_~x~0_160 (* v_main_~y~0_93 2))) .cse0) (and (or (not .cse0) (not (< v_main_~x~0_161 1000000))) .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_93, main_~x~0=v_main_~x~0_161, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_92, main_~x~0=v_main_~x~0_160, main_#t~post6=|v_main_#t~post6_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:29,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {2283#(<= main_~x~0 500000)} [87] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2283#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:29,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {2283#(<= main_~x~0 500000)} [88] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_163)) (.cse2 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse3 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse4 (= v_main_~x~0_163 v_main_~x~0_162)) (.cse5 (= |v_main_#t~post6_67| |v_main_#t~post6_63|))) (or (let ((.cse0 (+ v_main_~x~0_163 v_main_~y~0_94))) (and (= (+ v_main_~x~0_162 v_main_~y~0_95) .cse0) (< .cse0 (+ 750001 v_main_~y~0_95)) (< v_main_~y~0_95 v_main_~y~0_94) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_163 750000)) (not .cse1))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_163, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_162, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2284#(<= main_~x~0 750000)} is VALID [2022-04-15 06:49:29,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {2284#(<= main_~x~0 750000)} [83] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {2278#false} is VALID [2022-04-15 06:49:29,122 INFO L272 TraceCheckUtils]: 12: Hoare triple {2278#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {2278#false} is VALID [2022-04-15 06:49:29,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {2278#false} ~cond := #in~cond; {2278#false} is VALID [2022-04-15 06:49:29,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {2278#false} assume 0 == ~cond; {2278#false} is VALID [2022-04-15 06:49:29,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#false} assume !false; {2278#false} is VALID [2022-04-15 06:49:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:29,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:29,551 INFO L290 TraceCheckUtils]: 15: Hoare triple {2278#false} assume !false; {2278#false} is VALID [2022-04-15 06:49:29,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {2338#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2278#false} is VALID [2022-04-15 06:49:29,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2338#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:29,552 INFO L272 TraceCheckUtils]: 12: Hoare triple {2346#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {2342#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:49:29,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {2350#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [83] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {2346#(= main_~x~0 1000000)} is VALID [2022-04-15 06:49:29,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {2350#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [88] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_163)) (.cse2 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse3 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse4 (= v_main_~x~0_163 v_main_~x~0_162)) (.cse5 (= |v_main_#t~post6_67| |v_main_#t~post6_63|))) (or (let ((.cse0 (+ v_main_~x~0_163 v_main_~y~0_94))) (and (= (+ v_main_~x~0_162 v_main_~y~0_95) .cse0) (< .cse0 (+ 750001 v_main_~y~0_95)) (< v_main_~y~0_95 v_main_~y~0_94) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_163 750000)) (not .cse1))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_163, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_162, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2350#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:29,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {2350#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [87] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2350#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:29,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {2360#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [86] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_161)) (.cse1 (= v_main_~y~0_93 v_main_~y~0_92)) (.cse2 (= v_main_~x~0_161 v_main_~x~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_62|))) (or (and (< v_main_~y~0_92 (+ v_main_~y~0_93 (div (+ 999999 (* v_main_~x~0_161 (- 1))) 2) 2)) (< v_main_~y~0_93 v_main_~y~0_92) (= (+ v_main_~x~0_161 (* v_main_~y~0_92 2)) (+ v_main_~x~0_160 (* v_main_~y~0_93 2))) .cse0) (and (or (not .cse0) (not (< v_main_~x~0_161 1000000))) .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_93, main_~x~0=v_main_~x~0_161, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_92, main_~x~0=v_main_~x~0_160, main_#t~post6=|v_main_#t~post6_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {2350#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:29,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {2360#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [85] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2360#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:49:29,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {2360#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [84] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_44| |v_main_#t~post4_43|)) (.cse1 (= v_main_~x~0_159 v_main_~x~0_158))) (or (and (< v_main_~x~0_159 v_main_~x~0_158) (< v_main_~x~0_158 500001)) (and .cse0 (not (< v_main_~x~0_159 500000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_159, main_#t~post4=|v_main_#t~post4_44|} OutVars{main_~x~0=v_main_~x~0_158, main_#t~post4=|v_main_#t~post4_43|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2360#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:49:29,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {2277#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2360#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:49:29,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {2277#true} call #t~ret7 := main(); {2277#true} is VALID [2022-04-15 06:49:29,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2277#true} {2277#true} #48#return; {2277#true} is VALID [2022-04-15 06:49:29,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2277#true} assume true; {2277#true} is VALID [2022-04-15 06:49:29,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2277#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2277#true} is VALID [2022-04-15 06:49:29,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {2277#true} call ULTIMATE.init(); {2277#true} is VALID [2022-04-15 06:49:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:29,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974574886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:29,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:29,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:49:29,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287282811] [2022-04-15 06:49:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287282811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:29,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:49:29,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043197140] [2022-04-15 06:49:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:29,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:29,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:29,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:29,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:29,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:49:29,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:29,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:49:29,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:49:29,862 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:30,587 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-04-15 06:49:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:49:30,587 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-15 06:49:30,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2022-04-15 06:49:30,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2022-04-15 06:49:30,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:30,658 INFO L225 Difference]: With dead ends: 71 [2022-04-15 06:49:30,659 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:49:30,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:49:30,660 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:30,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 60 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:49:30,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:49:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-04-15 06:49:30,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:30,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:30,795 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:30,795 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:30,796 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 06:49:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 06:49:30,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:30,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:30,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:49:30,797 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:49:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:30,798 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-15 06:49:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-15 06:49:30,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:30,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:30,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:30,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:30,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-15 06:49:30,800 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 41 [2022-04-15 06:49:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:30,800 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-15 06:49:30,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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 06:49:30,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-15 06:49:30,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 06:49:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:49:30,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:30,858 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:30,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 06:49:31,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:31,061 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1207583873, now seen corresponding path program 6 times [2022-04-15 06:49:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:31,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795379228] [2022-04-15 06:49:31,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:32,286 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:32,515 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:32,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash 531554343, now seen corresponding path program 1 times [2022-04-15 06:49:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:32,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505700842] [2022-04-15 06:49:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:32,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:32,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2758#true} is VALID [2022-04-15 06:49:32,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {2758#true} assume true; {2758#true} is VALID [2022-04-15 06:49:32,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2758#true} {2758#true} #48#return; {2758#true} is VALID [2022-04-15 06:49:32,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {2758#true} call ULTIMATE.init(); {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:32,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2758#true} is VALID [2022-04-15 06:49:32,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {2758#true} assume true; {2758#true} is VALID [2022-04-15 06:49:32,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2758#true} {2758#true} #48#return; {2758#true} is VALID [2022-04-15 06:49:32,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {2758#true} call #t~ret7 := main(); {2758#true} is VALID [2022-04-15 06:49:32,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {2758#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2763#(= main_~x~0 0)} is VALID [2022-04-15 06:49:32,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {2763#(= main_~x~0 0)} [90] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_191 v_main_~x~0_190))) (or (and .cse0 .cse1) (and (< v_main_~x~0_190 500001) (< v_main_~x~0_191 v_main_~x~0_190)) (and .cse0 .cse1 (not (< v_main_~x~0_191 500000))))) InVars {main_~x~0=v_main_~x~0_191, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_190, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2764#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:32,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {2764#(<= main_~x~0 500000)} [91] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:32,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {2764#(<= main_~x~0 500000)} [92] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_77| |v_main_#t~post6_75|)) (.cse3 (<= 750000 v_main_~x~0_193)) (.cse1 (= v_main_~x~0_193 v_main_~x~0_192)) (.cse2 (= v_main_~y~0_115 v_main_~y~0_114))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_193 (* v_main_~y~0_114 2)) (+ v_main_~x~0_192 (* v_main_~y~0_115 2))) (< v_main_~y~0_114 (+ (div (+ (* v_main_~x~0_193 (- 1)) 999999) 2) v_main_~y~0_115 2)) .cse3 (< v_main_~y~0_115 v_main_~y~0_114)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_193 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_115, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_77|} OutVars{main_~y~0=v_main_~y~0_114, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_75|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {2765#(<= main_~x~0 749999)} is VALID [2022-04-15 06:49:32,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {2765#(<= main_~x~0 749999)} [93] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2765#(<= main_~x~0 749999)} is VALID [2022-04-15 06:49:32,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {2765#(<= main_~x~0 749999)} [94] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_80| |v_main_#t~post6_76|)) (.cse1 (= v_main_~y~0_117 v_main_~y~0_116)) (.cse2 (= v_main_~x~0_195 v_main_~x~0_194)) (.cse3 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse4 (<= 500000 v_main_~x~0_195))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_194 750001) .cse4 (< v_main_~x~0_195 v_main_~x~0_194) (= (+ v_main_~x~0_195 v_main_~y~0_116) (+ v_main_~x~0_194 v_main_~y~0_117))) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_195 750000)) (not .cse4))))) InVars {main_~y~0=v_main_~y~0_117, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_195, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_116, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2766#(<= main_~x~0 750000)} is VALID [2022-04-15 06:49:32,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {2766#(<= main_~x~0 750000)} [89] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {2759#false} is VALID [2022-04-15 06:49:32,580 INFO L272 TraceCheckUtils]: 12: Hoare triple {2759#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {2759#false} is VALID [2022-04-15 06:49:32,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {2759#false} ~cond := #in~cond; {2759#false} is VALID [2022-04-15 06:49:32,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {2759#false} assume 0 == ~cond; {2759#false} is VALID [2022-04-15 06:49:32,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {2759#false} assume !false; {2759#false} is VALID [2022-04-15 06:49:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:32,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505700842] [2022-04-15 06:49:32,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505700842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:32,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314921133] [2022-04-15 06:49:32,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:32,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:32,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:32,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:32,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 06:49:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:32,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:32,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:32,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {2758#true} call ULTIMATE.init(); {2758#true} is VALID [2022-04-15 06:49:32,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {2758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2758#true} is VALID [2022-04-15 06:49:32,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {2758#true} assume true; {2758#true} is VALID [2022-04-15 06:49:32,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2758#true} {2758#true} #48#return; {2758#true} is VALID [2022-04-15 06:49:32,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {2758#true} call #t~ret7 := main(); {2758#true} is VALID [2022-04-15 06:49:32,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {2758#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2786#(<= main_~x~0 0)} is VALID [2022-04-15 06:49:32,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#(<= main_~x~0 0)} [90] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_191 v_main_~x~0_190))) (or (and .cse0 .cse1) (and (< v_main_~x~0_190 500001) (< v_main_~x~0_191 v_main_~x~0_190)) (and .cse0 .cse1 (not (< v_main_~x~0_191 500000))))) InVars {main_~x~0=v_main_~x~0_191, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_190, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2764#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:32,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {2764#(<= main_~x~0 500000)} [91] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:32,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {2764#(<= main_~x~0 500000)} [92] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_77| |v_main_#t~post6_75|)) (.cse3 (<= 750000 v_main_~x~0_193)) (.cse1 (= v_main_~x~0_193 v_main_~x~0_192)) (.cse2 (= v_main_~y~0_115 v_main_~y~0_114))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_193 (* v_main_~y~0_114 2)) (+ v_main_~x~0_192 (* v_main_~y~0_115 2))) (< v_main_~y~0_114 (+ (div (+ (* v_main_~x~0_193 (- 1)) 999999) 2) v_main_~y~0_115 2)) .cse3 (< v_main_~y~0_115 v_main_~y~0_114)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_193 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_115, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_77|} OutVars{main_~y~0=v_main_~y~0_114, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_75|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {2764#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:32,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2764#(<= main_~x~0 500000)} [93] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2764#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:32,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {2764#(<= main_~x~0 500000)} [94] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_80| |v_main_#t~post6_76|)) (.cse1 (= v_main_~y~0_117 v_main_~y~0_116)) (.cse2 (= v_main_~x~0_195 v_main_~x~0_194)) (.cse3 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse4 (<= 500000 v_main_~x~0_195))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_194 750001) .cse4 (< v_main_~x~0_195 v_main_~x~0_194) (= (+ v_main_~x~0_195 v_main_~y~0_116) (+ v_main_~x~0_194 v_main_~y~0_117))) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_195 750000)) (not .cse4))))) InVars {main_~y~0=v_main_~y~0_117, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_195, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_116, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2766#(<= main_~x~0 750000)} is VALID [2022-04-15 06:49:32,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {2766#(<= main_~x~0 750000)} [89] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {2759#false} is VALID [2022-04-15 06:49:32,773 INFO L272 TraceCheckUtils]: 12: Hoare triple {2759#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {2759#false} is VALID [2022-04-15 06:49:32,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {2759#false} ~cond := #in~cond; {2759#false} is VALID [2022-04-15 06:49:32,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {2759#false} assume 0 == ~cond; {2759#false} is VALID [2022-04-15 06:49:32,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {2759#false} assume !false; {2759#false} is VALID [2022-04-15 06:49:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:32,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:33,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {2759#false} assume !false; {2759#false} is VALID [2022-04-15 06:49:33,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {2820#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2759#false} is VALID [2022-04-15 06:49:33,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {2824#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2820#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:33,180 INFO L272 TraceCheckUtils]: 12: Hoare triple {2828#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {2824#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:49:33,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {2832#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [89] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {2828#(= main_~x~0 1000000)} is VALID [2022-04-15 06:49:33,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {2832#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [94] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_80| |v_main_#t~post6_76|)) (.cse1 (= v_main_~y~0_117 v_main_~y~0_116)) (.cse2 (= v_main_~x~0_195 v_main_~x~0_194)) (.cse3 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse4 (<= 500000 v_main_~x~0_195))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_194 750001) .cse4 (< v_main_~x~0_195 v_main_~x~0_194) (= (+ v_main_~x~0_195 v_main_~y~0_116) (+ v_main_~x~0_194 v_main_~y~0_117))) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_195 750000)) (not .cse4))))) InVars {main_~y~0=v_main_~y~0_117, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_195, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_116, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2832#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:33,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {2832#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [93] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2832#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:33,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {2842#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [92] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_77| |v_main_#t~post6_75|)) (.cse3 (<= 750000 v_main_~x~0_193)) (.cse1 (= v_main_~x~0_193 v_main_~x~0_192)) (.cse2 (= v_main_~y~0_115 v_main_~y~0_114))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_193 (* v_main_~y~0_114 2)) (+ v_main_~x~0_192 (* v_main_~y~0_115 2))) (< v_main_~y~0_114 (+ (div (+ (* v_main_~x~0_193 (- 1)) 999999) 2) v_main_~y~0_115 2)) .cse3 (< v_main_~y~0_115 v_main_~y~0_114)) (and .cse0 (or (not .cse3) (not (< v_main_~x~0_193 1000000))) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_115, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_77|} OutVars{main_~y~0=v_main_~y~0_114, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_75|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {2832#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:33,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {2842#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [91] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2842#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:49:33,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {2842#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [90] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_51| |v_main_#t~post4_50|)) (.cse1 (= v_main_~x~0_191 v_main_~x~0_190))) (or (and .cse0 .cse1) (and (< v_main_~x~0_190 500001) (< v_main_~x~0_191 v_main_~x~0_190)) (and .cse0 .cse1 (not (< v_main_~x~0_191 500000))))) InVars {main_~x~0=v_main_~x~0_191, main_#t~post4=|v_main_#t~post4_51|} OutVars{main_~x~0=v_main_~x~0_190, main_#t~post4=|v_main_#t~post4_50|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2842#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:49:33,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {2758#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2842#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:49:33,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {2758#true} call #t~ret7 := main(); {2758#true} is VALID [2022-04-15 06:49:33,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2758#true} {2758#true} #48#return; {2758#true} is VALID [2022-04-15 06:49:33,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {2758#true} assume true; {2758#true} is VALID [2022-04-15 06:49:33,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {2758#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2758#true} is VALID [2022-04-15 06:49:33,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {2758#true} call ULTIMATE.init(); {2758#true} is VALID [2022-04-15 06:49:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:33,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314921133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:33,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:33,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 13 [2022-04-15 06:49:33,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:33,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795379228] [2022-04-15 06:49:33,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795379228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:33,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:33,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:49:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646936893] [2022-04-15 06:49:33,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:33,457 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:49:33,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:33,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:33,495 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 06:49:33,495 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:49:33,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:33,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:49:33,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:49:33,496 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:34,309 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-15 06:49:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:49:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:49:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-15 06:49:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 64 transitions. [2022-04-15 06:49:34,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 64 transitions. [2022-04-15 06:49:34,363 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 06:49:34,364 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:49:34,364 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 06:49:34,364 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=854, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:49:34,365 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:34,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:49:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 06:49:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-04-15 06:49:34,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:34,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 06:49:34,501 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 06:49:34,502 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 06:49:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:34,504 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 06:49:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 06:49:34,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:34,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:34,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 57 states. [2022-04-15 06:49:34,504 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 57 states. [2022-04-15 06:49:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:34,505 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 06:49:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 06:49:34,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:34,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:34,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:34,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 06:49:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-15 06:49:34,507 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 45 [2022-04-15 06:49:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:34,508 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-15 06:49:34,508 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 12 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:34,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-15 06:49:34,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 06:49:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 06:49:34,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:34,565 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:34,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:34,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:34,767 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash 763753304, now seen corresponding path program 7 times [2022-04-15 06:49:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:34,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2107778250] [2022-04-15 06:49:34,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:37,690 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:37,822 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:41,704 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:41,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:41,818 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:41,822 INFO L85 PathProgramCache]: Analyzing trace with hash 171979367, now seen corresponding path program 1 times [2022-04-15 06:49:41,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:41,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748558442] [2022-04-15 06:49:41,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:41,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {3275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3267#true} is VALID [2022-04-15 06:49:41,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {3267#true} assume true; {3267#true} is VALID [2022-04-15 06:49:41,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3267#true} {3267#true} #48#return; {3267#true} is VALID [2022-04-15 06:49:41,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {3267#true} call ULTIMATE.init(); {3275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:41,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {3275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3267#true} is VALID [2022-04-15 06:49:41,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#true} assume true; {3267#true} is VALID [2022-04-15 06:49:41,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3267#true} {3267#true} #48#return; {3267#true} is VALID [2022-04-15 06:49:41,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {3267#true} call #t~ret7 := main(); {3267#true} is VALID [2022-04-15 06:49:41,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {3267#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3272#(= main_~x~0 0)} is VALID [2022-04-15 06:49:41,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {3272#(= main_~x~0 0)} [96] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_58| |v_main_#t~post4_57|)) (.cse1 (= v_main_~x~0_224 v_main_~x~0_223))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_224 500000))) (and (< v_main_~x~0_224 v_main_~x~0_223) (< v_main_~x~0_223 500001)))) InVars {main_~x~0=v_main_~x~0_224, main_#t~post4=|v_main_#t~post4_58|} OutVars{main_~x~0=v_main_~x~0_223, main_#t~post4=|v_main_#t~post4_57|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3273#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:41,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {3273#(<= main_~x~0 500000)} [97] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3273#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:41,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {3273#(<= main_~x~0 500000)} [98] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_226)) (.cse1 (= v_main_~y~0_138 v_main_~y~0_137))) (or (and (< v_main_~y~0_138 v_main_~y~0_137) .cse0 (< v_main_~y~0_137 (+ v_main_~y~0_138 2 (div (+ 999999 (* v_main_~x~0_226 (- 1))) 2))) (= (+ v_main_~x~0_225 (* v_main_~y~0_138 2)) (+ v_main_~x~0_226 (* v_main_~y~0_137 2)))) (and (= v_main_~x~0_226 v_main_~x~0_225) (= |v_main_#t~post6_90| |v_main_#t~post6_88|) .cse1) (and (= v_main_~x~0_225 v_main_~x~0_226) (or (not (< v_main_~x~0_226 1000000)) (not .cse0)) (= |v_main_#t~post6_88| |v_main_#t~post6_90|) .cse1))) InVars {main_~y~0=v_main_~y~0_138, main_~x~0=v_main_~x~0_226, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_137, main_~x~0=v_main_~x~0_225, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {3274#(<= main_~x~0 999999)} is VALID [2022-04-15 06:49:41,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {3274#(<= main_~x~0 999999)} [99] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3274#(<= main_~x~0 999999)} is VALID [2022-04-15 06:49:41,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {3274#(<= main_~x~0 999999)} [100] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_228 v_main_~x~0_227)) (.cse1 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse2 (<= 500000 v_main_~x~0_228))) (or (and .cse0 .cse1 (= v_main_~y~0_140 v_main_~y~0_139) (= |v_main_#t~post6_93| |v_main_#t~post6_89|)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_228 750000))) (= v_main_~y~0_139 v_main_~y~0_140) .cse1 (= |v_main_#t~post6_89| |v_main_#t~post6_93|)) (and (= (+ v_main_~x~0_228 v_main_~y~0_139) (+ v_main_~x~0_227 v_main_~y~0_140)) (< v_main_~x~0_227 750001) (< v_main_~x~0_228 v_main_~x~0_227) .cse2))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_93|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_227, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3274#(<= main_~x~0 999999)} is VALID [2022-04-15 06:49:41,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {3274#(<= main_~x~0 999999)} [95] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {3268#false} is VALID [2022-04-15 06:49:41,892 INFO L272 TraceCheckUtils]: 12: Hoare triple {3268#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {3268#false} is VALID [2022-04-15 06:49:41,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {3268#false} ~cond := #in~cond; {3268#false} is VALID [2022-04-15 06:49:41,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {3268#false} assume 0 == ~cond; {3268#false} is VALID [2022-04-15 06:49:41,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {3268#false} assume !false; {3268#false} is VALID [2022-04-15 06:49:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:49:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748558442] [2022-04-15 06:49:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748558442] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643974377] [2022-04-15 06:49:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:41,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:41,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 06:49:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:41,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:42,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {3267#true} call ULTIMATE.init(); {3267#true} is VALID [2022-04-15 06:49:42,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3267#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3267#true} is VALID [2022-04-15 06:49:42,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#true} assume true; {3267#true} is VALID [2022-04-15 06:49:42,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3267#true} {3267#true} #48#return; {3267#true} is VALID [2022-04-15 06:49:42,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {3267#true} call #t~ret7 := main(); {3267#true} is VALID [2022-04-15 06:49:42,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {3267#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3294#(<= main_~x~0 0)} is VALID [2022-04-15 06:49:42,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {3294#(<= main_~x~0 0)} [96] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_58| |v_main_#t~post4_57|)) (.cse1 (= v_main_~x~0_224 v_main_~x~0_223))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_224 500000))) (and (< v_main_~x~0_224 v_main_~x~0_223) (< v_main_~x~0_223 500001)))) InVars {main_~x~0=v_main_~x~0_224, main_#t~post4=|v_main_#t~post4_58|} OutVars{main_~x~0=v_main_~x~0_223, main_#t~post4=|v_main_#t~post4_57|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3273#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:42,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {3273#(<= main_~x~0 500000)} [97] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3273#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:42,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {3273#(<= main_~x~0 500000)} [98] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_226)) (.cse1 (= v_main_~y~0_138 v_main_~y~0_137))) (or (and (< v_main_~y~0_138 v_main_~y~0_137) .cse0 (< v_main_~y~0_137 (+ v_main_~y~0_138 2 (div (+ 999999 (* v_main_~x~0_226 (- 1))) 2))) (= (+ v_main_~x~0_225 (* v_main_~y~0_138 2)) (+ v_main_~x~0_226 (* v_main_~y~0_137 2)))) (and (= v_main_~x~0_226 v_main_~x~0_225) (= |v_main_#t~post6_90| |v_main_#t~post6_88|) .cse1) (and (= v_main_~x~0_225 v_main_~x~0_226) (or (not (< v_main_~x~0_226 1000000)) (not .cse0)) (= |v_main_#t~post6_88| |v_main_#t~post6_90|) .cse1))) InVars {main_~y~0=v_main_~y~0_138, main_~x~0=v_main_~x~0_226, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_137, main_~x~0=v_main_~x~0_225, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {3273#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:42,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {3273#(<= main_~x~0 500000)} [99] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3273#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:42,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {3273#(<= main_~x~0 500000)} [100] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_228 v_main_~x~0_227)) (.cse1 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse2 (<= 500000 v_main_~x~0_228))) (or (and .cse0 .cse1 (= v_main_~y~0_140 v_main_~y~0_139) (= |v_main_#t~post6_93| |v_main_#t~post6_89|)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_228 750000))) (= v_main_~y~0_139 v_main_~y~0_140) .cse1 (= |v_main_#t~post6_89| |v_main_#t~post6_93|)) (and (= (+ v_main_~x~0_228 v_main_~y~0_139) (+ v_main_~x~0_227 v_main_~y~0_140)) (< v_main_~x~0_227 750001) (< v_main_~x~0_228 v_main_~x~0_227) .cse2))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_93|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_227, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3310#(< main_~x~0 750001)} is VALID [2022-04-15 06:49:42,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {3310#(< main_~x~0 750001)} [95] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {3268#false} is VALID [2022-04-15 06:49:42,100 INFO L272 TraceCheckUtils]: 12: Hoare triple {3268#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {3268#false} is VALID [2022-04-15 06:49:42,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {3268#false} ~cond := #in~cond; {3268#false} is VALID [2022-04-15 06:49:42,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {3268#false} assume 0 == ~cond; {3268#false} is VALID [2022-04-15 06:49:42,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {3268#false} assume !false; {3268#false} is VALID [2022-04-15 06:49:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:42,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:42,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {3268#false} assume !false; {3268#false} is VALID [2022-04-15 06:49:42,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {3329#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3268#false} is VALID [2022-04-15 06:49:42,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {3333#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3329#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:49:42,538 INFO L272 TraceCheckUtils]: 12: Hoare triple {3337#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {3333#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:49:42,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {3341#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [95] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {3337#(= main_~x~0 1000000)} is VALID [2022-04-15 06:49:42,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {3341#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [100] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_228 v_main_~x~0_227)) (.cse1 (= |v_main_#t~post5_47| |v_main_#t~post5_46|)) (.cse2 (<= 500000 v_main_~x~0_228))) (or (and .cse0 .cse1 (= v_main_~y~0_140 v_main_~y~0_139) (= |v_main_#t~post6_93| |v_main_#t~post6_89|)) (and .cse0 (or (not .cse2) (not (< v_main_~x~0_228 750000))) (= v_main_~y~0_139 v_main_~y~0_140) .cse1 (= |v_main_#t~post6_89| |v_main_#t~post6_93|)) (and (= (+ v_main_~x~0_228 v_main_~y~0_139) (+ v_main_~x~0_227 v_main_~y~0_140)) (< v_main_~x~0_227 750001) (< v_main_~x~0_228 v_main_~x~0_227) .cse2))) InVars {main_~y~0=v_main_~y~0_140, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_93|} OutVars{main_~y~0=v_main_~y~0_139, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_227, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3341#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:42,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {3341#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [99] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3341#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:42,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {3351#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [98] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_226)) (.cse1 (= v_main_~y~0_138 v_main_~y~0_137))) (or (and (< v_main_~y~0_138 v_main_~y~0_137) .cse0 (< v_main_~y~0_137 (+ v_main_~y~0_138 2 (div (+ 999999 (* v_main_~x~0_226 (- 1))) 2))) (= (+ v_main_~x~0_225 (* v_main_~y~0_138 2)) (+ v_main_~x~0_226 (* v_main_~y~0_137 2)))) (and (= v_main_~x~0_226 v_main_~x~0_225) (= |v_main_#t~post6_90| |v_main_#t~post6_88|) .cse1) (and (= v_main_~x~0_225 v_main_~x~0_226) (or (not (< v_main_~x~0_226 1000000)) (not .cse0)) (= |v_main_#t~post6_88| |v_main_#t~post6_90|) .cse1))) InVars {main_~y~0=v_main_~y~0_138, main_~x~0=v_main_~x~0_226, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_137, main_~x~0=v_main_~x~0_225, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {3341#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:49:42,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {3351#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [97] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3351#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:49:42,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {3351#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [96] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_58| |v_main_#t~post4_57|)) (.cse1 (= v_main_~x~0_224 v_main_~x~0_223))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_224 500000))) (and (< v_main_~x~0_224 v_main_~x~0_223) (< v_main_~x~0_223 500001)))) InVars {main_~x~0=v_main_~x~0_224, main_#t~post4=|v_main_#t~post4_58|} OutVars{main_~x~0=v_main_~x~0_223, main_#t~post4=|v_main_#t~post4_57|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3351#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:49:42,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {3267#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3351#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:49:42,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {3267#true} call #t~ret7 := main(); {3267#true} is VALID [2022-04-15 06:49:42,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3267#true} {3267#true} #48#return; {3267#true} is VALID [2022-04-15 06:49:42,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#true} assume true; {3267#true} is VALID [2022-04-15 06:49:42,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {3267#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3267#true} is VALID [2022-04-15 06:49:42,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {3267#true} call ULTIMATE.init(); {3267#true} is VALID [2022-04-15 06:49:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:42,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643974377] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:42,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:42,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:49:42,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:42,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2107778250] [2022-04-15 06:49:42,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2107778250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:42,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:42,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:49:42,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207274577] [2022-04-15 06:49:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:42,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:49:42,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:42,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:42,909 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 06:49:42,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:49:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:42,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:49:42,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:49:42,910 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:43,834 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-15 06:49:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:49:43,834 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 06:49:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-15 06:49:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:43,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-15 06:49:43,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-15 06:49:43,894 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 06:49:43,895 INFO L225 Difference]: With dead ends: 79 [2022-04-15 06:49:43,895 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 06:49:43,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:49:43,896 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:43,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 67 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:49:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 06:49:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-04-15 06:49:44,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:44,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:44,069 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:44,069 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:44,070 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:49:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:49:44,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:44,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:44,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 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 61 states. [2022-04-15 06:49:44,071 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 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 61 states. [2022-04-15 06:49:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:44,072 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 06:49:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-15 06:49:44,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:44,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:44,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:44,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-15 06:49:44,074 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 49 [2022-04-15 06:49:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:44,074 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-15 06:49:44,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:44,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-15 06:49:44,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 06:49:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:49:44,140 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:44,140 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:44,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:44,340 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,SelfDestructingSolverStorable9 [2022-04-15 06:49:44,341 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -178233681, now seen corresponding path program 8 times [2022-04-15 06:49:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062340939] [2022-04-15 06:49:48,417 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:48,472 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:48,734 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:52,881 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:53,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:53,007 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash -187595609, now seen corresponding path program 1 times [2022-04-15 06:49:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:53,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620803699] [2022-04-15 06:49:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:53,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {3811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3803#true} is VALID [2022-04-15 06:49:53,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {3803#true} assume true; {3803#true} is VALID [2022-04-15 06:49:53,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3803#true} {3803#true} #48#return; {3803#true} is VALID [2022-04-15 06:49:53,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:53,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {3811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3803#true} is VALID [2022-04-15 06:49:53,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2022-04-15 06:49:53,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #48#return; {3803#true} is VALID [2022-04-15 06:49:53,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret7 := main(); {3803#true} is VALID [2022-04-15 06:49:53,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {3803#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3808#(= main_~x~0 0)} is VALID [2022-04-15 06:49:53,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {3808#(= main_~x~0 0)} [102] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|)) (.cse1 (= v_main_~x~0_258 v_main_~x~0_257))) (or (and (< v_main_~x~0_257 500001) (< v_main_~x~0_258 v_main_~x~0_257)) (and .cse0 .cse1) (and (not (< v_main_~x~0_258 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_258, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_257, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {3809#(<= main_~x~0 500000)} [103] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {3809#(<= main_~x~0 500000)} [104] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_103| |v_main_#t~post6_101|)) (.cse2 (= v_main_~y~0_162 v_main_~y~0_161)) (.cse1 (<= 750000 v_main_~x~0_260))) (or (and (= v_main_~x~0_259 v_main_~x~0_260) .cse0 (or (not (< v_main_~x~0_260 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2 (= v_main_~x~0_260 v_main_~x~0_259)) (and (< v_main_~y~0_161 (+ (div (+ 999999 (* v_main_~x~0_260 (- 1))) 2) v_main_~y~0_162 2)) (< v_main_~y~0_162 v_main_~y~0_161) (= (+ (* v_main_~y~0_161 2) v_main_~x~0_260) (+ v_main_~x~0_259 (* v_main_~y~0_162 2))) .cse1))) InVars {main_~y~0=v_main_~y~0_162, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_103|} OutVars{main_~y~0=v_main_~y~0_161, main_~x~0=v_main_~x~0_259, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {3809#(<= main_~x~0 500000)} [105] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {3809#(<= main_~x~0 500000)} [106] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_262)) (.cse2 (= v_main_~y~0_164 v_main_~y~0_163)) (.cse3 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse4 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse5 (= |v_main_#t~post6_106| |v_main_#t~post6_102|))) (or (let ((.cse0 (+ v_main_~x~0_262 v_main_~y~0_163))) (and (= (+ v_main_~x~0_261 v_main_~y~0_164) .cse0) (< v_main_~y~0_164 v_main_~y~0_163) .cse1 (< .cse0 (+ 750001 v_main_~y~0_164)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_262 750000))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_164, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_106|} OutVars{main_~y~0=v_main_~y~0_163, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_102|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3810#(<= main_~x~0 750000)} is VALID [2022-04-15 06:49:53,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {3810#(<= main_~x~0 750000)} [101] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {3804#false} is VALID [2022-04-15 06:49:53,079 INFO L272 TraceCheckUtils]: 12: Hoare triple {3804#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {3804#false} is VALID [2022-04-15 06:49:53,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2022-04-15 06:49:53,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {3804#false} assume 0 == ~cond; {3804#false} is VALID [2022-04-15 06:49:53,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2022-04-15 06:49:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:53,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:53,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620803699] [2022-04-15 06:49:53,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620803699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:53,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452239992] [2022-04-15 06:49:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:53,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:53,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:53,081 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:53,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 06:49:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:53,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:49:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:53,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:53,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2022-04-15 06:49:53,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3803#true} is VALID [2022-04-15 06:49:53,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2022-04-15 06:49:53,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #48#return; {3803#true} is VALID [2022-04-15 06:49:53,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret7 := main(); {3803#true} is VALID [2022-04-15 06:49:53,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {3803#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3830#(<= main_~x~0 0)} is VALID [2022-04-15 06:49:53,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {3830#(<= main_~x~0 0)} [102] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|)) (.cse1 (= v_main_~x~0_258 v_main_~x~0_257))) (or (and (< v_main_~x~0_257 500001) (< v_main_~x~0_258 v_main_~x~0_257)) (and .cse0 .cse1) (and (not (< v_main_~x~0_258 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_258, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_257, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {3809#(<= main_~x~0 500000)} [103] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {3809#(<= main_~x~0 500000)} [104] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_103| |v_main_#t~post6_101|)) (.cse2 (= v_main_~y~0_162 v_main_~y~0_161)) (.cse1 (<= 750000 v_main_~x~0_260))) (or (and (= v_main_~x~0_259 v_main_~x~0_260) .cse0 (or (not (< v_main_~x~0_260 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2 (= v_main_~x~0_260 v_main_~x~0_259)) (and (< v_main_~y~0_161 (+ (div (+ 999999 (* v_main_~x~0_260 (- 1))) 2) v_main_~y~0_162 2)) (< v_main_~y~0_162 v_main_~y~0_161) (= (+ (* v_main_~y~0_161 2) v_main_~x~0_260) (+ v_main_~x~0_259 (* v_main_~y~0_162 2))) .cse1))) InVars {main_~y~0=v_main_~y~0_162, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_103|} OutVars{main_~y~0=v_main_~y~0_161, main_~x~0=v_main_~x~0_259, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {3809#(<= main_~x~0 500000)} [105] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3809#(<= main_~x~0 500000)} is VALID [2022-04-15 06:49:53,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {3809#(<= main_~x~0 500000)} [106] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_262)) (.cse2 (= v_main_~y~0_164 v_main_~y~0_163)) (.cse3 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse4 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse5 (= |v_main_#t~post6_106| |v_main_#t~post6_102|))) (or (let ((.cse0 (+ v_main_~x~0_262 v_main_~y~0_163))) (and (= (+ v_main_~x~0_261 v_main_~y~0_164) .cse0) (< v_main_~y~0_164 v_main_~y~0_163) .cse1 (< .cse0 (+ 750001 v_main_~y~0_164)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_262 750000))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_164, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_106|} OutVars{main_~y~0=v_main_~y~0_163, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_102|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3810#(<= main_~x~0 750000)} is VALID [2022-04-15 06:49:53,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {3810#(<= main_~x~0 750000)} [101] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {3804#false} is VALID [2022-04-15 06:49:53,258 INFO L272 TraceCheckUtils]: 12: Hoare triple {3804#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {3804#false} is VALID [2022-04-15 06:49:53,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {3804#false} ~cond := #in~cond; {3804#false} is VALID [2022-04-15 06:49:53,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {3804#false} assume 0 == ~cond; {3804#false} is VALID [2022-04-15 06:49:53,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2022-04-15 06:49:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:53,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:02,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {3804#false} assume !false; {3804#false} is VALID [2022-04-15 06:50:02,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {3864#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3804#false} is VALID [2022-04-15 06:50:02,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {3868#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3864#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:50:02,025 INFO L272 TraceCheckUtils]: 12: Hoare triple {3872#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {3868#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:50:02,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {3876#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [101] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {3872#(= main_~x~0 1000000)} is VALID [2022-04-15 06:50:02,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {3876#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [106] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_262)) (.cse2 (= v_main_~y~0_164 v_main_~y~0_163)) (.cse3 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse4 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse5 (= |v_main_#t~post6_106| |v_main_#t~post6_102|))) (or (let ((.cse0 (+ v_main_~x~0_262 v_main_~y~0_163))) (and (= (+ v_main_~x~0_261 v_main_~y~0_164) .cse0) (< v_main_~y~0_164 v_main_~y~0_163) .cse1 (< .cse0 (+ 750001 v_main_~y~0_164)))) (and .cse2 .cse3 .cse4 .cse5) (and (or (not .cse1) (not (< v_main_~x~0_262 750000))) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_164, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_106|} OutVars{main_~y~0=v_main_~y~0_163, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_102|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3876#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:02,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3876#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [105] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3876#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:02,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {3886#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [104] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_103| |v_main_#t~post6_101|)) (.cse2 (= v_main_~y~0_162 v_main_~y~0_161)) (.cse1 (<= 750000 v_main_~x~0_260))) (or (and (= v_main_~x~0_259 v_main_~x~0_260) .cse0 (or (not (< v_main_~x~0_260 1000000)) (not .cse1)) .cse2) (and .cse0 .cse2 (= v_main_~x~0_260 v_main_~x~0_259)) (and (< v_main_~y~0_161 (+ (div (+ 999999 (* v_main_~x~0_260 (- 1))) 2) v_main_~y~0_162 2)) (< v_main_~y~0_162 v_main_~y~0_161) (= (+ (* v_main_~y~0_161 2) v_main_~x~0_260) (+ v_main_~x~0_259 (* v_main_~y~0_162 2))) .cse1))) InVars {main_~y~0=v_main_~y~0_162, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_103|} OutVars{main_~y~0=v_main_~y~0_161, main_~x~0=v_main_~x~0_259, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {3876#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:02,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {3886#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [103] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3886#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:50:02,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {3886#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [102] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|)) (.cse1 (= v_main_~x~0_258 v_main_~x~0_257))) (or (and (< v_main_~x~0_257 500001) (< v_main_~x~0_258 v_main_~x~0_257)) (and .cse0 .cse1) (and (not (< v_main_~x~0_258 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_258, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_257, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3886#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:50:02,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {3803#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3886#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:50:02,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {3803#true} call #t~ret7 := main(); {3803#true} is VALID [2022-04-15 06:50:02,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3803#true} {3803#true} #48#return; {3803#true} is VALID [2022-04-15 06:50:02,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {3803#true} assume true; {3803#true} is VALID [2022-04-15 06:50:02,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {3803#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3803#true} is VALID [2022-04-15 06:50:02,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {3803#true} call ULTIMATE.init(); {3803#true} is VALID [2022-04-15 06:50:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452239992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:02,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:50:02,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:02,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062340939] [2022-04-15 06:50:02,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062340939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:02,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:02,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:50:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269713840] [2022-04-15 06:50:02,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:02,433 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 06:50:02,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:02,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:02,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:02,481 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:50:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:02,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:50:02,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:50:02,482 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,573 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2022-04-15 06:50:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:50:03,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 06:50:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-15 06:50:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-15 06:50:03,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2022-04-15 06:50:03,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:03,633 INFO L225 Difference]: With dead ends: 83 [2022-04-15 06:50:03,633 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:50:03,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:50:03,634 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:03,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 73 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:50:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:50:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-04-15 06:50:03,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:03,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,840 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,840 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,841 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-15 06:50:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-15 06:50:03,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:03,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:03,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 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 06:50:03,842 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 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 06:50:03,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,842 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-15 06:50:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-15 06:50:03,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:03,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:03,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:03,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-15 06:50:03,844 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 53 [2022-04-15 06:50:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:03,844 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-15 06:50:03,844 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:03,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-15 06:50:03,920 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 06:50:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 06:50:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 06:50:03,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:03,920 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:03,937 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 06:50:04,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:04,121 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:04,122 INFO L85 PathProgramCache]: Analyzing trace with hash 685196934, now seen corresponding path program 9 times [2022-04-15 06:50:04,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:04,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929082272] [2022-04-15 06:50:04,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:04,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:08,599 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:08,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:08,723 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:08,727 INFO L85 PathProgramCache]: Analyzing trace with hash -547170585, now seen corresponding path program 1 times [2022-04-15 06:50:08,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:08,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529691610] [2022-04-15 06:50:08,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:08,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:08,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4365#true} is VALID [2022-04-15 06:50:08,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {4365#true} assume true; {4365#true} is VALID [2022-04-15 06:50:08,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4365#true} {4365#true} #48#return; {4365#true} is VALID [2022-04-15 06:50:08,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {4365#true} call ULTIMATE.init(); {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:08,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {4373#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4365#true} is VALID [2022-04-15 06:50:08,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {4365#true} assume true; {4365#true} is VALID [2022-04-15 06:50:08,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4365#true} {4365#true} #48#return; {4365#true} is VALID [2022-04-15 06:50:08,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {4365#true} call #t~ret7 := main(); {4365#true} is VALID [2022-04-15 06:50:08,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {4365#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4370#(= main_~x~0 0)} is VALID [2022-04-15 06:50:08,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {4370#(= main_~x~0 0)} [108] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_72| |v_main_#t~post4_71|)) (.cse1 (= v_main_~x~0_293 v_main_~x~0_292))) (or (and (< v_main_~x~0_293 v_main_~x~0_292) (< v_main_~x~0_292 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_293) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_293, main_#t~post4=|v_main_#t~post4_72|} OutVars{main_~x~0=v_main_~x~0_292, main_#t~post4=|v_main_#t~post4_71|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {4371#(<= main_~x~0 500000)} [109] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {4371#(<= main_~x~0 500000)} [110] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_295 v_main_~x~0_294)) (.cse0 (<= 750000 v_main_~x~0_295)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_114|))) (or (and (= (+ v_main_~x~0_294 (* v_main_~y~0_187 2)) (+ v_main_~x~0_295 (* v_main_~y~0_186 2))) (< v_main_~y~0_186 (+ v_main_~y~0_187 2 (div (+ (* v_main_~x~0_295 (- 1)) 999999) 2))) (< v_main_~y~0_187 v_main_~y~0_186) .cse0) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 (or (not (< v_main_~x~0_295 1000000)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_187, main_~x~0=v_main_~x~0_295, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_186, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {4371#(<= main_~x~0 500000)} [111] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {4371#(<= main_~x~0 500000)} [112] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_297)) (.cse1 (= v_main_~x~0_297 v_main_~x~0_296)) (.cse2 (= v_main_~y~0_189 v_main_~y~0_188)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_296 750001) (= (+ v_main_~x~0_297 v_main_~y~0_188) (+ v_main_~x~0_296 v_main_~y~0_189)) (< v_main_~x~0_297 v_main_~x~0_296) .cse0) (and .cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_119|) (or (not .cse0) (not (< v_main_~x~0_297 750000))) .cse2 .cse3) (and .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_115|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_297, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_188, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_296, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4372#(<= main_~x~0 750000)} is VALID [2022-04-15 06:50:08,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(<= main_~x~0 750000)} [107] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {4366#false} is VALID [2022-04-15 06:50:08,801 INFO L272 TraceCheckUtils]: 12: Hoare triple {4366#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {4366#false} is VALID [2022-04-15 06:50:08,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {4366#false} ~cond := #in~cond; {4366#false} is VALID [2022-04-15 06:50:08,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {4366#false} assume 0 == ~cond; {4366#false} is VALID [2022-04-15 06:50:08,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {4366#false} assume !false; {4366#false} is VALID [2022-04-15 06:50:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:08,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:08,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529691610] [2022-04-15 06:50:08,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529691610] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:08,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364398953] [2022-04-15 06:50:08,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:08,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:08,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:08,802 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:50:08,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 06:50:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:08,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:50:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:08,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:08,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {4365#true} call ULTIMATE.init(); {4365#true} is VALID [2022-04-15 06:50:08,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {4365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4365#true} is VALID [2022-04-15 06:50:08,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {4365#true} assume true; {4365#true} is VALID [2022-04-15 06:50:08,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4365#true} {4365#true} #48#return; {4365#true} is VALID [2022-04-15 06:50:08,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {4365#true} call #t~ret7 := main(); {4365#true} is VALID [2022-04-15 06:50:08,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {4365#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4392#(<= main_~x~0 0)} is VALID [2022-04-15 06:50:08,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {4392#(<= main_~x~0 0)} [108] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_72| |v_main_#t~post4_71|)) (.cse1 (= v_main_~x~0_293 v_main_~x~0_292))) (or (and (< v_main_~x~0_293 v_main_~x~0_292) (< v_main_~x~0_292 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_293) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_293, main_#t~post4=|v_main_#t~post4_72|} OutVars{main_~x~0=v_main_~x~0_292, main_#t~post4=|v_main_#t~post4_71|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {4371#(<= main_~x~0 500000)} [109] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {4371#(<= main_~x~0 500000)} [110] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_295 v_main_~x~0_294)) (.cse0 (<= 750000 v_main_~x~0_295)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_114|))) (or (and (= (+ v_main_~x~0_294 (* v_main_~y~0_187 2)) (+ v_main_~x~0_295 (* v_main_~y~0_186 2))) (< v_main_~y~0_186 (+ v_main_~y~0_187 2 (div (+ (* v_main_~x~0_295 (- 1)) 999999) 2))) (< v_main_~y~0_187 v_main_~y~0_186) .cse0) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 (or (not (< v_main_~x~0_295 1000000)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_187, main_~x~0=v_main_~x~0_295, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_186, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {4371#(<= main_~x~0 500000)} [111] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4371#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:08,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {4371#(<= main_~x~0 500000)} [112] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_297)) (.cse1 (= v_main_~x~0_297 v_main_~x~0_296)) (.cse2 (= v_main_~y~0_189 v_main_~y~0_188)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_296 750001) (= (+ v_main_~x~0_297 v_main_~y~0_188) (+ v_main_~x~0_296 v_main_~y~0_189)) (< v_main_~x~0_297 v_main_~x~0_296) .cse0) (and .cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_119|) (or (not .cse0) (not (< v_main_~x~0_297 750000))) .cse2 .cse3) (and .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_115|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_297, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_188, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_296, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4372#(<= main_~x~0 750000)} is VALID [2022-04-15 06:50:08,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {4372#(<= main_~x~0 750000)} [107] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {4366#false} is VALID [2022-04-15 06:50:08,989 INFO L272 TraceCheckUtils]: 12: Hoare triple {4366#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {4366#false} is VALID [2022-04-15 06:50:08,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {4366#false} ~cond := #in~cond; {4366#false} is VALID [2022-04-15 06:50:08,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {4366#false} assume 0 == ~cond; {4366#false} is VALID [2022-04-15 06:50:08,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {4366#false} assume !false; {4366#false} is VALID [2022-04-15 06:50:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:08,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:09,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {4366#false} assume !false; {4366#false} is VALID [2022-04-15 06:50:09,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {4426#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4366#false} is VALID [2022-04-15 06:50:09,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {4430#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4426#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:50:09,394 INFO L272 TraceCheckUtils]: 12: Hoare triple {4434#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {4430#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:50:09,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {4438#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [107] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {4434#(= main_~x~0 1000000)} is VALID [2022-04-15 06:50:09,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {4438#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [112] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_297)) (.cse1 (= v_main_~x~0_297 v_main_~x~0_296)) (.cse2 (= v_main_~y~0_189 v_main_~y~0_188)) (.cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (< v_main_~x~0_296 750001) (= (+ v_main_~x~0_297 v_main_~y~0_188) (+ v_main_~x~0_296 v_main_~y~0_189)) (< v_main_~x~0_297 v_main_~x~0_296) .cse0) (and .cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_119|) (or (not .cse0) (not (< v_main_~x~0_297 750000))) .cse2 .cse3) (and .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_115|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_297, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_188, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_296, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4438#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:09,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {4438#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [111] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4438#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:09,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {4448#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [110] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_295 v_main_~x~0_294)) (.cse0 (<= 750000 v_main_~x~0_295)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_114|))) (or (and (= (+ v_main_~x~0_294 (* v_main_~y~0_187 2)) (+ v_main_~x~0_295 (* v_main_~y~0_186 2))) (< v_main_~y~0_186 (+ v_main_~y~0_187 2 (div (+ (* v_main_~x~0_295 (- 1)) 999999) 2))) (< v_main_~y~0_187 v_main_~y~0_186) .cse0) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 (or (not (< v_main_~x~0_295 1000000)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_187, main_~x~0=v_main_~x~0_295, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_186, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {4438#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:09,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {4448#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [109] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4448#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:09,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {4448#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [108] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_72| |v_main_#t~post4_71|)) (.cse1 (= v_main_~x~0_293 v_main_~x~0_292))) (or (and (< v_main_~x~0_293 v_main_~x~0_292) (< v_main_~x~0_292 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_293) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_293, main_#t~post4=|v_main_#t~post4_72|} OutVars{main_~x~0=v_main_~x~0_292, main_#t~post4=|v_main_#t~post4_71|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4448#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:09,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {4365#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4448#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:09,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {4365#true} call #t~ret7 := main(); {4365#true} is VALID [2022-04-15 06:50:09,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4365#true} {4365#true} #48#return; {4365#true} is VALID [2022-04-15 06:50:09,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {4365#true} assume true; {4365#true} is VALID [2022-04-15 06:50:09,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {4365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4365#true} is VALID [2022-04-15 06:50:09,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {4365#true} call ULTIMATE.init(); {4365#true} is VALID [2022-04-15 06:50:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:09,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364398953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:09,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:09,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:50:09,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:09,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1929082272] [2022-04-15 06:50:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1929082272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:09,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:09,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:50:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534317077] [2022-04-15 06:50:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:09,785 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 06:50:09,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:09,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:09,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:09,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:50:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:09,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:50:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:50:09,824 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:11,159 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-15 06:50:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:50:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 06:50:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-04-15 06:50:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 76 transitions. [2022-04-15 06:50:11,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 76 transitions. [2022-04-15 06:50:11,232 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 06:50:11,233 INFO L225 Difference]: With dead ends: 87 [2022-04-15 06:50:11,233 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 06:50:11,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:50:11,234 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:11,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 79 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:50:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 06:50:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-04-15 06:50:11,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:11,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 06:50:11,476 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 06:50:11,476 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 06:50:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:11,477 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:50:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:50:11,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:11,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:11,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 69 states. [2022-04-15 06:50:11,477 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 69 states. [2022-04-15 06:50:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:11,479 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 06:50:11,479 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 06:50:11,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:11,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:11,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:11,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 06:50:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-04-15 06:50:11,480 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 57 [2022-04-15 06:50:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:11,480 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-04-15 06:50:11,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:11,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2022-04-15 06:50:11,555 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 06:50:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-04-15 06:50:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:50:11,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:11,556 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:11,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 06:50:11,756 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,SelfDestructingSolverStorable11 [2022-04-15 06:50:11,757 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1951951581, now seen corresponding path program 10 times [2022-04-15 06:50:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:11,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518103677] [2022-04-15 06:50:15,821 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:15,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:16,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:16,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:16,752 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:16,755 INFO L85 PathProgramCache]: Analyzing trace with hash -906745561, now seen corresponding path program 1 times [2022-04-15 06:50:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:16,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455043832] [2022-04-15 06:50:16,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:16,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {4963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4954#true} is VALID [2022-04-15 06:50:16,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {4954#true} assume true; {4954#true} is VALID [2022-04-15 06:50:16,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4954#true} {4954#true} #48#return; {4954#true} is VALID [2022-04-15 06:50:16,808 INFO L272 TraceCheckUtils]: 0: Hoare triple {4954#true} call ULTIMATE.init(); {4963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:16,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {4963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4954#true} is VALID [2022-04-15 06:50:16,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {4954#true} assume true; {4954#true} is VALID [2022-04-15 06:50:16,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4954#true} {4954#true} #48#return; {4954#true} is VALID [2022-04-15 06:50:16,809 INFO L272 TraceCheckUtils]: 4: Hoare triple {4954#true} call #t~ret7 := main(); {4954#true} is VALID [2022-04-15 06:50:16,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {4954#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4959#(= main_~x~0 0)} is VALID [2022-04-15 06:50:16,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {4959#(= main_~x~0 0)} [114] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_329 v_main_~x~0_328)) (.cse1 (= |v_main_#t~post4_79| |v_main_#t~post4_78|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_329 500000)) .cse0 .cse1) (and (< v_main_~x~0_329 v_main_~x~0_328) (< v_main_~x~0_328 500001)))) InVars {main_~x~0=v_main_~x~0_329, main_#t~post4=|v_main_#t~post4_79|} OutVars{main_~x~0=v_main_~x~0_328, main_#t~post4=|v_main_#t~post4_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4960#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:16,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {4960#(<= main_~x~0 500000)} [115] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4960#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:16,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {4960#(<= main_~x~0 500000)} [116] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_129| |v_main_#t~post6_127|)) (.cse1 (= v_main_~x~0_331 v_main_~x~0_330)) (.cse3 (= v_main_~y~0_213 v_main_~y~0_212)) (.cse2 (<= 750000 v_main_~x~0_331))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_331 1000000))) .cse3) (and .cse0 .cse1 .cse3) (and .cse2 (= (+ v_main_~x~0_331 (* v_main_~y~0_212 2)) (+ v_main_~x~0_330 (* v_main_~y~0_213 2))) (< v_main_~y~0_212 (+ v_main_~y~0_213 2 (div (+ 999999 (* v_main_~x~0_331 (- 1))) 2))) (< v_main_~y~0_213 v_main_~y~0_212)))) InVars {main_~y~0=v_main_~y~0_213, main_~x~0=v_main_~x~0_331, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_212, main_~x~0=v_main_~x~0_330, main_#t~post6=|v_main_#t~post6_127|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {4961#(<= main_~x~0 749999)} is VALID [2022-04-15 06:50:16,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {4961#(<= main_~x~0 749999)} [117] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4961#(<= main_~x~0 749999)} is VALID [2022-04-15 06:50:16,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {4961#(<= main_~x~0 749999)} [118] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse3 (= |v_main_#t~post6_132| |v_main_#t~post6_128|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|)) (.cse5 (= v_main_~x~0_333 v_main_~x~0_332)) (.cse0 (<= 500000 v_main_~x~0_333))) (or (let ((.cse1 (+ v_main_~x~0_333 v_main_~y~0_214))) (and (< v_main_~y~0_215 v_main_~y~0_214) .cse0 (= (+ v_main_~x~0_332 v_main_~y~0_215) .cse1) (< .cse1 (+ 750001 v_main_~y~0_215)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_333 750000)))))) InVars {main_~y~0=v_main_~y~0_215, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_333, main_#t~post6=|v_main_#t~post6_132|} OutVars{main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_332, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4962#(<= main_~x~0 750000)} is VALID [2022-04-15 06:50:16,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {4962#(<= main_~x~0 750000)} [113] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {4955#false} is VALID [2022-04-15 06:50:16,813 INFO L272 TraceCheckUtils]: 12: Hoare triple {4955#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {4955#false} is VALID [2022-04-15 06:50:16,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {4955#false} ~cond := #in~cond; {4955#false} is VALID [2022-04-15 06:50:16,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {4955#false} assume 0 == ~cond; {4955#false} is VALID [2022-04-15 06:50:16,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {4955#false} assume !false; {4955#false} is VALID [2022-04-15 06:50:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:50:16,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:16,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455043832] [2022-04-15 06:50:16,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455043832] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:16,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022117422] [2022-04-15 06:50:16,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:16,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:16,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:50:16,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 06:50:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:16,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:50:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:16,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:17,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {4954#true} call ULTIMATE.init(); {4954#true} is VALID [2022-04-15 06:50:17,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {4954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4954#true} is VALID [2022-04-15 06:50:17,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {4954#true} assume true; {4954#true} is VALID [2022-04-15 06:50:17,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4954#true} {4954#true} #48#return; {4954#true} is VALID [2022-04-15 06:50:17,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {4954#true} call #t~ret7 := main(); {4954#true} is VALID [2022-04-15 06:50:17,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {4954#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4982#(<= main_~x~0 0)} is VALID [2022-04-15 06:50:17,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {4982#(<= main_~x~0 0)} [114] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_329 v_main_~x~0_328)) (.cse1 (= |v_main_#t~post4_79| |v_main_#t~post4_78|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_329 500000)) .cse0 .cse1) (and (< v_main_~x~0_329 v_main_~x~0_328) (< v_main_~x~0_328 500001)))) InVars {main_~x~0=v_main_~x~0_329, main_#t~post4=|v_main_#t~post4_79|} OutVars{main_~x~0=v_main_~x~0_328, main_#t~post4=|v_main_#t~post4_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4960#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:17,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {4960#(<= main_~x~0 500000)} [115] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4960#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:17,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {4960#(<= main_~x~0 500000)} [116] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_129| |v_main_#t~post6_127|)) (.cse1 (= v_main_~x~0_331 v_main_~x~0_330)) (.cse3 (= v_main_~y~0_213 v_main_~y~0_212)) (.cse2 (<= 750000 v_main_~x~0_331))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_331 1000000))) .cse3) (and .cse0 .cse1 .cse3) (and .cse2 (= (+ v_main_~x~0_331 (* v_main_~y~0_212 2)) (+ v_main_~x~0_330 (* v_main_~y~0_213 2))) (< v_main_~y~0_212 (+ v_main_~y~0_213 2 (div (+ 999999 (* v_main_~x~0_331 (- 1))) 2))) (< v_main_~y~0_213 v_main_~y~0_212)))) InVars {main_~y~0=v_main_~y~0_213, main_~x~0=v_main_~x~0_331, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_212, main_~x~0=v_main_~x~0_330, main_#t~post6=|v_main_#t~post6_127|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {4960#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:17,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {4960#(<= main_~x~0 500000)} [117] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4960#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:17,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {4960#(<= main_~x~0 500000)} [118] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse3 (= |v_main_#t~post6_132| |v_main_#t~post6_128|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|)) (.cse5 (= v_main_~x~0_333 v_main_~x~0_332)) (.cse0 (<= 500000 v_main_~x~0_333))) (or (let ((.cse1 (+ v_main_~x~0_333 v_main_~y~0_214))) (and (< v_main_~y~0_215 v_main_~y~0_214) .cse0 (= (+ v_main_~x~0_332 v_main_~y~0_215) .cse1) (< .cse1 (+ 750001 v_main_~y~0_215)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_333 750000)))))) InVars {main_~y~0=v_main_~y~0_215, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_333, main_#t~post6=|v_main_#t~post6_132|} OutVars{main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_332, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4962#(<= main_~x~0 750000)} is VALID [2022-04-15 06:50:17,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {4962#(<= main_~x~0 750000)} [113] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {4955#false} is VALID [2022-04-15 06:50:17,032 INFO L272 TraceCheckUtils]: 12: Hoare triple {4955#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {4955#false} is VALID [2022-04-15 06:50:17,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {4955#false} ~cond := #in~cond; {4955#false} is VALID [2022-04-15 06:50:17,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {4955#false} assume 0 == ~cond; {4955#false} is VALID [2022-04-15 06:50:17,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {4955#false} assume !false; {4955#false} is VALID [2022-04-15 06:50:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:17,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:29,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {4955#false} assume !false; {4955#false} is VALID [2022-04-15 06:50:29,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4955#false} is VALID [2022-04-15 06:50:29,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {5020#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5016#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:50:29,827 INFO L272 TraceCheckUtils]: 12: Hoare triple {5024#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {5020#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:50:29,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {5028#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [113] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {5024#(= main_~x~0 1000000)} is VALID [2022-04-15 06:50:29,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {5028#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [118] L11-2-->L10-2_primed: Formula: (let ((.cse2 (= v_main_~y~0_215 v_main_~y~0_214)) (.cse3 (= |v_main_#t~post6_132| |v_main_#t~post6_128|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|)) (.cse5 (= v_main_~x~0_333 v_main_~x~0_332)) (.cse0 (<= 500000 v_main_~x~0_333))) (or (let ((.cse1 (+ v_main_~x~0_333 v_main_~y~0_214))) (and (< v_main_~y~0_215 v_main_~y~0_214) .cse0 (= (+ v_main_~x~0_332 v_main_~y~0_215) .cse1) (< .cse1 (+ 750001 v_main_~y~0_215)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_333 750000)))))) InVars {main_~y~0=v_main_~y~0_215, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_333, main_#t~post6=|v_main_#t~post6_132|} OutVars{main_~y~0=v_main_~y~0_214, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_332, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5028#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:29,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {5028#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [117] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5028#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:29,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {5038#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [116] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_129| |v_main_#t~post6_127|)) (.cse1 (= v_main_~x~0_331 v_main_~x~0_330)) (.cse3 (= v_main_~y~0_213 v_main_~y~0_212)) (.cse2 (<= 750000 v_main_~x~0_331))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_331 1000000))) .cse3) (and .cse0 .cse1 .cse3) (and .cse2 (= (+ v_main_~x~0_331 (* v_main_~y~0_212 2)) (+ v_main_~x~0_330 (* v_main_~y~0_213 2))) (< v_main_~y~0_212 (+ v_main_~y~0_213 2 (div (+ 999999 (* v_main_~x~0_331 (- 1))) 2))) (< v_main_~y~0_213 v_main_~y~0_212)))) InVars {main_~y~0=v_main_~y~0_213, main_~x~0=v_main_~x~0_331, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_212, main_~x~0=v_main_~x~0_330, main_#t~post6=|v_main_#t~post6_127|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {5028#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:29,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [115] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5038#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:29,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [114] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_329 v_main_~x~0_328)) (.cse1 (= |v_main_#t~post4_79| |v_main_#t~post4_78|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_329 500000)) .cse0 .cse1) (and (< v_main_~x~0_329 v_main_~x~0_328) (< v_main_~x~0_328 500001)))) InVars {main_~x~0=v_main_~x~0_329, main_#t~post4=|v_main_#t~post4_79|} OutVars{main_~x~0=v_main_~x~0_328, main_#t~post4=|v_main_#t~post4_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5038#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:29,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {4954#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5038#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:29,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {4954#true} call #t~ret7 := main(); {4954#true} is VALID [2022-04-15 06:50:29,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4954#true} {4954#true} #48#return; {4954#true} is VALID [2022-04-15 06:50:29,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {4954#true} assume true; {4954#true} is VALID [2022-04-15 06:50:29,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {4954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {4954#true} is VALID [2022-04-15 06:50:29,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {4954#true} call ULTIMATE.init(); {4954#true} is VALID [2022-04-15 06:50:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022117422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:29,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 13 [2022-04-15 06:50:30,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518103677] [2022-04-15 06:50:30,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518103677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:30,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:30,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:50:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896314260] [2022-04-15 06:50:30,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:30,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:50:30,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:30,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:30,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:30,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:50:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:30,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:50:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:50:30,248 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:31,784 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-15 06:50:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:50:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 06:50:31,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-04-15 06:50:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 80 transitions. [2022-04-15 06:50:31,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 80 transitions. [2022-04-15 06:50:31,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:31,876 INFO L225 Difference]: With dead ends: 91 [2022-04-15 06:50:31,876 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 06:50:31,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:50:31,877 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:31,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:50:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 06:50:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2022-04-15 06:50:32,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:32,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:32,175 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:32,175 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:32,176 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 06:50:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-15 06:50:32,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:32,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:32,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 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 73 states. [2022-04-15 06:50:32,176 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 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 73 states. [2022-04-15 06:50:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:32,177 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 06:50:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-15 06:50:32,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:32,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:32,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:32,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-15 06:50:32,178 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 61 [2022-04-15 06:50:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:32,179 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-15 06:50:32,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 16 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:32,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-15 06:50:32,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 06:50:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 06:50:32,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:32,263 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:32,279 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 06:50:32,464 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,SelfDestructingSolverStorable12 [2022-04-15 06:50:32,464 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:32,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:32,465 INFO L85 PathProgramCache]: Analyzing trace with hash 393317300, now seen corresponding path program 11 times [2022-04-15 06:50:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:32,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481382534] [2022-04-15 06:50:36,535 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:36,599 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:36,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:37,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:37,104 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1266320537, now seen corresponding path program 1 times [2022-04-15 06:50:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:37,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387426253] [2022-04-15 06:50:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:37,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-15 06:50:37,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 06:50:37,162 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5571#true} {5571#true} #48#return; {5571#true} is VALID [2022-04-15 06:50:37,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:37,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {5579#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-15 06:50:37,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 06:50:37,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5571#true} {5571#true} #48#return; {5571#true} is VALID [2022-04-15 06:50:37,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call #t~ret7 := main(); {5571#true} is VALID [2022-04-15 06:50:37,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5576#(= main_~x~0 0)} is VALID [2022-04-15 06:50:37,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {5576#(= main_~x~0 0)} [120] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_86| |v_main_#t~post4_85|)) (.cse1 (= v_main_~x~0_366 v_main_~x~0_365))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_366)) (and .cse0 .cse1) (and (< v_main_~x~0_366 v_main_~x~0_365) (< v_main_~x~0_365 500001)))) InVars {main_~x~0=v_main_~x~0_366, main_#t~post4=|v_main_#t~post4_86|} OutVars{main_~x~0=v_main_~x~0_365, main_#t~post4=|v_main_#t~post4_85|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5577#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:37,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {5577#(<= main_~x~0 500000)} [121] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5577#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:37,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {5577#(<= main_~x~0 500000)} [122] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_368)) (.cse1 (= v_main_~x~0_368 v_main_~x~0_367)) (.cse2 (= |v_main_#t~post6_142| |v_main_#t~post6_140|))) (or (and (or (not (< v_main_~x~0_368 1000000)) (not .cse0)) (= v_main_~y~0_239 v_main_~y~0_240) .cse1 .cse2) (and .cse0 (= (+ v_main_~x~0_367 (* v_main_~y~0_240 2)) (+ v_main_~x~0_368 (* v_main_~y~0_239 2))) (< v_main_~y~0_240 v_main_~y~0_239) (< v_main_~y~0_239 (+ v_main_~y~0_240 2 (div (+ 999999 (* v_main_~x~0_368 (- 1))) 2)))) (and .cse1 (= v_main_~y~0_240 v_main_~y~0_239) .cse2))) InVars {main_~y~0=v_main_~y~0_240, main_~x~0=v_main_~x~0_368, main_#t~post6=|v_main_#t~post6_142|} OutVars{main_~y~0=v_main_~y~0_239, main_~x~0=v_main_~x~0_367, main_#t~post6=|v_main_#t~post6_140|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {5578#(<= main_~x~0 999999)} is VALID [2022-04-15 06:50:37,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {5578#(<= main_~x~0 999999)} [123] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5578#(<= main_~x~0 999999)} is VALID [2022-04-15 06:50:37,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {5578#(<= main_~x~0 999999)} [124] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_71| |v_main_#t~post5_70|)) (.cse1 (= |v_main_#t~post6_145| |v_main_#t~post6_141|)) (.cse2 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse3 (<= 500000 v_main_~x~0_370))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_370 v_main_~x~0_369)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_369 v_main_~x~0_370) (or (not .cse3) (not (< v_main_~x~0_370 750000)))) (and (= (+ v_main_~x~0_369 v_main_~y~0_242) (+ v_main_~x~0_370 v_main_~y~0_241)) (< v_main_~x~0_370 v_main_~x~0_369) (< v_main_~x~0_369 750001) .cse3))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_71|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_369, main_#t~post6=|v_main_#t~post6_141|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5578#(<= main_~x~0 999999)} is VALID [2022-04-15 06:50:37,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {5578#(<= main_~x~0 999999)} [119] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {5572#false} is VALID [2022-04-15 06:50:37,166 INFO L272 TraceCheckUtils]: 12: Hoare triple {5572#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {5572#false} is VALID [2022-04-15 06:50:37,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-15 06:50:37,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 06:50:37,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 06:50:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:50:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:37,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387426253] [2022-04-15 06:50:37,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387426253] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:37,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324414946] [2022-04-15 06:50:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:37,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:37,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:37,168 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:50:37,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:50:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:37,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:50:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:37,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:37,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-15 06:50:37,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-15 06:50:37,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 06:50:37,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5571#true} {5571#true} #48#return; {5571#true} is VALID [2022-04-15 06:50:37,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call #t~ret7 := main(); {5571#true} is VALID [2022-04-15 06:50:37,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5598#(<= main_~x~0 0)} is VALID [2022-04-15 06:50:37,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {5598#(<= main_~x~0 0)} [120] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_86| |v_main_#t~post4_85|)) (.cse1 (= v_main_~x~0_366 v_main_~x~0_365))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_366)) (and .cse0 .cse1) (and (< v_main_~x~0_366 v_main_~x~0_365) (< v_main_~x~0_365 500001)))) InVars {main_~x~0=v_main_~x~0_366, main_#t~post4=|v_main_#t~post4_86|} OutVars{main_~x~0=v_main_~x~0_365, main_#t~post4=|v_main_#t~post4_85|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5577#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:37,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {5577#(<= main_~x~0 500000)} [121] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5577#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:37,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {5577#(<= main_~x~0 500000)} [122] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_368)) (.cse1 (= v_main_~x~0_368 v_main_~x~0_367)) (.cse2 (= |v_main_#t~post6_142| |v_main_#t~post6_140|))) (or (and (or (not (< v_main_~x~0_368 1000000)) (not .cse0)) (= v_main_~y~0_239 v_main_~y~0_240) .cse1 .cse2) (and .cse0 (= (+ v_main_~x~0_367 (* v_main_~y~0_240 2)) (+ v_main_~x~0_368 (* v_main_~y~0_239 2))) (< v_main_~y~0_240 v_main_~y~0_239) (< v_main_~y~0_239 (+ v_main_~y~0_240 2 (div (+ 999999 (* v_main_~x~0_368 (- 1))) 2)))) (and .cse1 (= v_main_~y~0_240 v_main_~y~0_239) .cse2))) InVars {main_~y~0=v_main_~y~0_240, main_~x~0=v_main_~x~0_368, main_#t~post6=|v_main_#t~post6_142|} OutVars{main_~y~0=v_main_~y~0_239, main_~x~0=v_main_~x~0_367, main_#t~post6=|v_main_#t~post6_140|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {5577#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:37,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {5577#(<= main_~x~0 500000)} [123] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5577#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:37,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {5577#(<= main_~x~0 500000)} [124] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_71| |v_main_#t~post5_70|)) (.cse1 (= |v_main_#t~post6_145| |v_main_#t~post6_141|)) (.cse2 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse3 (<= 500000 v_main_~x~0_370))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_370 v_main_~x~0_369)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_369 v_main_~x~0_370) (or (not .cse3) (not (< v_main_~x~0_370 750000)))) (and (= (+ v_main_~x~0_369 v_main_~y~0_242) (+ v_main_~x~0_370 v_main_~y~0_241)) (< v_main_~x~0_370 v_main_~x~0_369) (< v_main_~x~0_369 750001) .cse3))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_71|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_369, main_#t~post6=|v_main_#t~post6_141|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5614#(< main_~x~0 750001)} is VALID [2022-04-15 06:50:37,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {5614#(< main_~x~0 750001)} [119] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {5572#false} is VALID [2022-04-15 06:50:37,359 INFO L272 TraceCheckUtils]: 12: Hoare triple {5572#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {5572#false} is VALID [2022-04-15 06:50:37,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {5572#false} ~cond := #in~cond; {5572#false} is VALID [2022-04-15 06:50:37,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {5572#false} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 06:50:37,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 06:50:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:37,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:48,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {5572#false} assume !false; {5572#false} is VALID [2022-04-15 06:50:48,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {5633#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5572#false} is VALID [2022-04-15 06:50:48,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {5637#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5633#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:50:48,106 INFO L272 TraceCheckUtils]: 12: Hoare triple {5641#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {5637#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:50:48,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {5645#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [119] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {5641#(= main_~x~0 1000000)} is VALID [2022-04-15 06:50:48,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {5645#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [124] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_71| |v_main_#t~post5_70|)) (.cse1 (= |v_main_#t~post6_145| |v_main_#t~post6_141|)) (.cse2 (= v_main_~y~0_242 v_main_~y~0_241)) (.cse3 (<= 500000 v_main_~x~0_370))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_370 v_main_~x~0_369)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_369 v_main_~x~0_370) (or (not .cse3) (not (< v_main_~x~0_370 750000)))) (and (= (+ v_main_~x~0_369 v_main_~y~0_242) (+ v_main_~x~0_370 v_main_~y~0_241)) (< v_main_~x~0_370 v_main_~x~0_369) (< v_main_~x~0_369 750001) .cse3))) InVars {main_~y~0=v_main_~y~0_242, main_#t~post5=|v_main_#t~post5_71|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_241, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_369, main_#t~post6=|v_main_#t~post6_141|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5645#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:48,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {5645#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [123] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5645#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:48,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {5655#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [122] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_368)) (.cse1 (= v_main_~x~0_368 v_main_~x~0_367)) (.cse2 (= |v_main_#t~post6_142| |v_main_#t~post6_140|))) (or (and (or (not (< v_main_~x~0_368 1000000)) (not .cse0)) (= v_main_~y~0_239 v_main_~y~0_240) .cse1 .cse2) (and .cse0 (= (+ v_main_~x~0_367 (* v_main_~y~0_240 2)) (+ v_main_~x~0_368 (* v_main_~y~0_239 2))) (< v_main_~y~0_240 v_main_~y~0_239) (< v_main_~y~0_239 (+ v_main_~y~0_240 2 (div (+ 999999 (* v_main_~x~0_368 (- 1))) 2)))) (and .cse1 (= v_main_~y~0_240 v_main_~y~0_239) .cse2))) InVars {main_~y~0=v_main_~y~0_240, main_~x~0=v_main_~x~0_368, main_#t~post6=|v_main_#t~post6_142|} OutVars{main_~y~0=v_main_~y~0_239, main_~x~0=v_main_~x~0_367, main_#t~post6=|v_main_#t~post6_140|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {5645#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:48,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {5655#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [121] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5655#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:50:48,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {5655#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [120] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_86| |v_main_#t~post4_85|)) (.cse1 (= v_main_~x~0_366 v_main_~x~0_365))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_366)) (and .cse0 .cse1) (and (< v_main_~x~0_366 v_main_~x~0_365) (< v_main_~x~0_365 500001)))) InVars {main_~x~0=v_main_~x~0_366, main_#t~post4=|v_main_#t~post4_86|} OutVars{main_~x~0=v_main_~x~0_365, main_#t~post4=|v_main_#t~post4_85|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5655#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:50:48,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {5571#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5655#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:50:48,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {5571#true} call #t~ret7 := main(); {5571#true} is VALID [2022-04-15 06:50:48,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5571#true} {5571#true} #48#return; {5571#true} is VALID [2022-04-15 06:50:48,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {5571#true} assume true; {5571#true} is VALID [2022-04-15 06:50:48,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5571#true} is VALID [2022-04-15 06:50:48,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {5571#true} call ULTIMATE.init(); {5571#true} is VALID [2022-04-15 06:50:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:48,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324414946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:48,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:48,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:50:48,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:48,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481382534] [2022-04-15 06:50:48,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481382534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:48,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:50:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850046170] [2022-04-15 06:50:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:48,578 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 06:50:48,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:48,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:48,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:48,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:50:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:48,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:50:48,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:50:48,623 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:50,470 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2022-04-15 06:50:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:50:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 06:50:50,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2022-04-15 06:50:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 84 transitions. [2022-04-15 06:50:50,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 84 transitions. [2022-04-15 06:50:50,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:50,538 INFO L225 Difference]: With dead ends: 95 [2022-04-15 06:50:50,538 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 06:50:50,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1535, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:50:50,540 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:50,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:50:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 06:50:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2022-04-15 06:50:50,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:50,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,867 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,867 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:50,868 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-15 06:50:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-15 06:50:50,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:50,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:50,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 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 77 states. [2022-04-15 06:50:50,869 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 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 77 states. [2022-04-15 06:50:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:50,870 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-15 06:50:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-15 06:50:50,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:50,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:50,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:50,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-04-15 06:50:50,872 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 65 [2022-04-15 06:50:50,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:50,872 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-04-15 06:50:50,872 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.388888888888889) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:50,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2022-04-15 06:50:50,982 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 06:50:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-15 06:50:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 06:50:50,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:50,983 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:50,999 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 06:50:51,183 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,SelfDestructingSolverStorable13 [2022-04-15 06:50:51,184 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1422944523, now seen corresponding path program 12 times [2022-04-15 06:50:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:51,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1004072973] [2022-04-15 06:50:51,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:54,496 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:54,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:54,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:54,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1625895513, now seen corresponding path program 1 times [2022-04-15 06:50:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:54,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785391510] [2022-04-15 06:50:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {6223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6215#true} is VALID [2022-04-15 06:50:54,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {6215#true} assume true; {6215#true} is VALID [2022-04-15 06:50:54,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6215#true} {6215#true} #48#return; {6215#true} is VALID [2022-04-15 06:50:54,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {6215#true} call ULTIMATE.init(); {6223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:54,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {6223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6215#true} is VALID [2022-04-15 06:50:54,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {6215#true} assume true; {6215#true} is VALID [2022-04-15 06:50:54,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6215#true} {6215#true} #48#return; {6215#true} is VALID [2022-04-15 06:50:54,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {6215#true} call #t~ret7 := main(); {6215#true} is VALID [2022-04-15 06:50:54,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {6215#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6220#(= main_~x~0 0)} is VALID [2022-04-15 06:50:54,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {6220#(= main_~x~0 0)} [126] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_93| |v_main_#t~post4_92|)) (.cse1 (= v_main_~x~0_404 v_main_~x~0_403))) (or (and (< v_main_~x~0_403 500001) (< v_main_~x~0_404 v_main_~x~0_403)) (and (<= 500000 v_main_~x~0_404) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_404, main_#t~post4=|v_main_#t~post4_93|} OutVars{main_~x~0=v_main_~x~0_403, main_#t~post4=|v_main_#t~post4_92|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:54,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {6221#(<= main_~x~0 500000)} [127] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:54,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {6221#(<= main_~x~0 500000)} [128] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_155| |v_main_#t~post6_153|)) (.cse1 (= v_main_~y~0_268 v_main_~y~0_267)) (.cse2 (= v_main_~x~0_406 v_main_~x~0_405)) (.cse3 (<= 750000 v_main_~x~0_406))) (or (and .cse0 .cse1 .cse2) (and (or (not (< v_main_~x~0_406 1000000)) (not .cse3)) .cse0 .cse1 .cse2) (and (< v_main_~y~0_267 (+ (div (+ 999999 (* v_main_~x~0_406 (- 1))) 2) v_main_~y~0_268 2)) .cse3 (< v_main_~y~0_268 v_main_~y~0_267) (= (+ v_main_~x~0_405 (* v_main_~y~0_268 2)) (+ v_main_~x~0_406 (* v_main_~y~0_267 2)))))) InVars {main_~y~0=v_main_~y~0_268, main_~x~0=v_main_~x~0_406, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_267, main_~x~0=v_main_~x~0_405, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:54,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {6221#(<= main_~x~0 500000)} [129] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:54,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {6221#(<= main_~x~0 500000)} [130] L11-2-->L10-2_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_408)) (.cse0 (= |v_main_#t~post6_158| |v_main_#t~post6_154|)) (.cse1 (= v_main_~x~0_408 v_main_~x~0_407)) (.cse2 (= |v_main_#t~post5_77| |v_main_#t~post5_76|))) (or (and .cse0 (= v_main_~y~0_270 v_main_~y~0_269) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_408 v_main_~y~0_269))) (and (= .cse3 (+ v_main_~x~0_407 v_main_~y~0_270)) (< .cse3 (+ 750001 v_main_~y~0_270)) .cse4 (< v_main_~y~0_270 v_main_~y~0_269))) (and (= v_main_~y~0_269 v_main_~y~0_270) (or (not .cse4) (not (< v_main_~x~0_408 750000))) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_270, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_408, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_76|, main_~x~0=v_main_~x~0_407, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6222#(<= main_~x~0 750000)} is VALID [2022-04-15 06:50:54,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {6222#(<= main_~x~0 750000)} [125] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {6216#false} is VALID [2022-04-15 06:50:54,933 INFO L272 TraceCheckUtils]: 12: Hoare triple {6216#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {6216#false} is VALID [2022-04-15 06:50:54,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {6216#false} ~cond := #in~cond; {6216#false} is VALID [2022-04-15 06:50:54,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {6216#false} assume 0 == ~cond; {6216#false} is VALID [2022-04-15 06:50:54,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {6216#false} assume !false; {6216#false} is VALID [2022-04-15 06:50:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:54,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:54,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785391510] [2022-04-15 06:50:54,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785391510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:54,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847344455] [2022-04-15 06:50:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:54,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:54,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:54,935 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:50:54,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:50:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:50:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:55,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {6215#true} call ULTIMATE.init(); {6215#true} is VALID [2022-04-15 06:50:55,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {6215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6215#true} is VALID [2022-04-15 06:50:55,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {6215#true} assume true; {6215#true} is VALID [2022-04-15 06:50:55,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6215#true} {6215#true} #48#return; {6215#true} is VALID [2022-04-15 06:50:55,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {6215#true} call #t~ret7 := main(); {6215#true} is VALID [2022-04-15 06:50:55,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {6215#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6242#(<= main_~x~0 0)} is VALID [2022-04-15 06:50:55,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {6242#(<= main_~x~0 0)} [126] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_93| |v_main_#t~post4_92|)) (.cse1 (= v_main_~x~0_404 v_main_~x~0_403))) (or (and (< v_main_~x~0_403 500001) (< v_main_~x~0_404 v_main_~x~0_403)) (and (<= 500000 v_main_~x~0_404) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_404, main_#t~post4=|v_main_#t~post4_93|} OutVars{main_~x~0=v_main_~x~0_403, main_#t~post4=|v_main_#t~post4_92|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:55,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {6221#(<= main_~x~0 500000)} [127] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:55,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {6221#(<= main_~x~0 500000)} [128] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_155| |v_main_#t~post6_153|)) (.cse1 (= v_main_~y~0_268 v_main_~y~0_267)) (.cse2 (= v_main_~x~0_406 v_main_~x~0_405)) (.cse3 (<= 750000 v_main_~x~0_406))) (or (and .cse0 .cse1 .cse2) (and (or (not (< v_main_~x~0_406 1000000)) (not .cse3)) .cse0 .cse1 .cse2) (and (< v_main_~y~0_267 (+ (div (+ 999999 (* v_main_~x~0_406 (- 1))) 2) v_main_~y~0_268 2)) .cse3 (< v_main_~y~0_268 v_main_~y~0_267) (= (+ v_main_~x~0_405 (* v_main_~y~0_268 2)) (+ v_main_~x~0_406 (* v_main_~y~0_267 2)))))) InVars {main_~y~0=v_main_~y~0_268, main_~x~0=v_main_~x~0_406, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_267, main_~x~0=v_main_~x~0_405, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:55,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {6221#(<= main_~x~0 500000)} [129] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6221#(<= main_~x~0 500000)} is VALID [2022-04-15 06:50:55,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {6221#(<= main_~x~0 500000)} [130] L11-2-->L10-2_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_408)) (.cse0 (= |v_main_#t~post6_158| |v_main_#t~post6_154|)) (.cse1 (= v_main_~x~0_408 v_main_~x~0_407)) (.cse2 (= |v_main_#t~post5_77| |v_main_#t~post5_76|))) (or (and .cse0 (= v_main_~y~0_270 v_main_~y~0_269) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_408 v_main_~y~0_269))) (and (= .cse3 (+ v_main_~x~0_407 v_main_~y~0_270)) (< .cse3 (+ 750001 v_main_~y~0_270)) .cse4 (< v_main_~y~0_270 v_main_~y~0_269))) (and (= v_main_~y~0_269 v_main_~y~0_270) (or (not .cse4) (not (< v_main_~x~0_408 750000))) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_270, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_408, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_76|, main_~x~0=v_main_~x~0_407, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6222#(<= main_~x~0 750000)} is VALID [2022-04-15 06:50:55,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {6222#(<= main_~x~0 750000)} [125] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {6216#false} is VALID [2022-04-15 06:50:55,109 INFO L272 TraceCheckUtils]: 12: Hoare triple {6216#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {6216#false} is VALID [2022-04-15 06:50:55,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {6216#false} ~cond := #in~cond; {6216#false} is VALID [2022-04-15 06:50:55,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {6216#false} assume 0 == ~cond; {6216#false} is VALID [2022-04-15 06:50:55,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {6216#false} assume !false; {6216#false} is VALID [2022-04-15 06:50:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:55,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:55,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {6216#false} assume !false; {6216#false} is VALID [2022-04-15 06:50:55,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {6276#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6216#false} is VALID [2022-04-15 06:50:55,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {6280#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6276#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:50:55,520 INFO L272 TraceCheckUtils]: 12: Hoare triple {6284#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {6280#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:50:55,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {6288#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [125] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {6284#(= main_~x~0 1000000)} is VALID [2022-04-15 06:50:55,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {6288#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [130] L11-2-->L10-2_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_408)) (.cse0 (= |v_main_#t~post6_158| |v_main_#t~post6_154|)) (.cse1 (= v_main_~x~0_408 v_main_~x~0_407)) (.cse2 (= |v_main_#t~post5_77| |v_main_#t~post5_76|))) (or (and .cse0 (= v_main_~y~0_270 v_main_~y~0_269) .cse1 .cse2) (let ((.cse3 (+ v_main_~x~0_408 v_main_~y~0_269))) (and (= .cse3 (+ v_main_~x~0_407 v_main_~y~0_270)) (< .cse3 (+ 750001 v_main_~y~0_270)) .cse4 (< v_main_~y~0_270 v_main_~y~0_269))) (and (= v_main_~y~0_269 v_main_~y~0_270) (or (not .cse4) (not (< v_main_~x~0_408 750000))) .cse0 .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_270, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_408, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_76|, main_~x~0=v_main_~x~0_407, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6288#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:55,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {6288#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [129] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6288#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:55,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {6298#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [128] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_155| |v_main_#t~post6_153|)) (.cse1 (= v_main_~y~0_268 v_main_~y~0_267)) (.cse2 (= v_main_~x~0_406 v_main_~x~0_405)) (.cse3 (<= 750000 v_main_~x~0_406))) (or (and .cse0 .cse1 .cse2) (and (or (not (< v_main_~x~0_406 1000000)) (not .cse3)) .cse0 .cse1 .cse2) (and (< v_main_~y~0_267 (+ (div (+ 999999 (* v_main_~x~0_406 (- 1))) 2) v_main_~y~0_268 2)) .cse3 (< v_main_~y~0_268 v_main_~y~0_267) (= (+ v_main_~x~0_405 (* v_main_~y~0_268 2)) (+ v_main_~x~0_406 (* v_main_~y~0_267 2)))))) InVars {main_~y~0=v_main_~y~0_268, main_~x~0=v_main_~x~0_406, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_267, main_~x~0=v_main_~x~0_405, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {6288#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:50:55,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {6298#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [127] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6298#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:55,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {6298#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [126] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_93| |v_main_#t~post4_92|)) (.cse1 (= v_main_~x~0_404 v_main_~x~0_403))) (or (and (< v_main_~x~0_403 500001) (< v_main_~x~0_404 v_main_~x~0_403)) (and (<= 500000 v_main_~x~0_404) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_404, main_#t~post4=|v_main_#t~post4_93|} OutVars{main_~x~0=v_main_~x~0_403, main_#t~post4=|v_main_#t~post4_92|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6298#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:55,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {6215#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6298#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:50:55,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {6215#true} call #t~ret7 := main(); {6215#true} is VALID [2022-04-15 06:50:55,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6215#true} {6215#true} #48#return; {6215#true} is VALID [2022-04-15 06:50:55,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {6215#true} assume true; {6215#true} is VALID [2022-04-15 06:50:55,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {6215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6215#true} is VALID [2022-04-15 06:50:55,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {6215#true} call ULTIMATE.init(); {6215#true} is VALID [2022-04-15 06:50:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:55,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847344455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:55,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:55,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:50:55,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1004072973] [2022-04-15 06:50:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1004072973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:55,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:55,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:50:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767624351] [2022-04-15 06:50:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 06:50:55,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:55,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:56,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:56,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:50:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:56,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:50:56,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:50:56,023 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:57,932 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2022-04-15 06:50:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:50:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 06:50:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 88 transitions. [2022-04-15 06:50:57,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 88 transitions. [2022-04-15 06:50:57,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 88 transitions. [2022-04-15 06:50:58,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:58,006 INFO L225 Difference]: With dead ends: 99 [2022-04-15 06:50:58,006 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 06:50:58,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:50:58,007 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:58,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 97 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:50:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 06:50:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2022-04-15 06:50:58,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:58,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 06:50:58,393 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 06:50:58,393 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 06:50:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:58,395 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-15 06:50:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-15 06:50:58,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:58,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:58,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 81 states. [2022-04-15 06:50:58,395 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 81 states. [2022-04-15 06:50:58,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:58,396 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-15 06:50:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-15 06:50:58,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:58,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:58,397 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:58,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 06:50:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-15 06:50:58,397 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 69 [2022-04-15 06:50:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:58,398 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-15 06:50:58,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 18 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:58,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-15 06:50:58,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-15 06:50:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 06:50:58,492 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:58,492 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:58,508 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 06:50:58,695 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,SelfDestructingSolverStorable14 [2022-04-15 06:50:58,696 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -498941214, now seen corresponding path program 13 times [2022-04-15 06:50:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:58,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253199164] [2022-04-15 06:51:02,792 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:02,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:03,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:03,455 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:03,456 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1985470489, now seen corresponding path program 1 times [2022-04-15 06:51:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:03,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38824375] [2022-04-15 06:51:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:03,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:03,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {6893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6885#true} is VALID [2022-04-15 06:51:03,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-15 06:51:03,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6885#true} {6885#true} #48#return; {6885#true} is VALID [2022-04-15 06:51:03,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:03,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {6893#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6885#true} is VALID [2022-04-15 06:51:03,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-15 06:51:03,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #48#return; {6885#true} is VALID [2022-04-15 06:51:03,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret7 := main(); {6885#true} is VALID [2022-04-15 06:51:03,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6890#(= main_~x~0 0)} is VALID [2022-04-15 06:51:03,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {6890#(= main_~x~0 0)} [132] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_443 v_main_~x~0_442))) (or (and (< v_main_~x~0_443 v_main_~x~0_442) (< v_main_~x~0_442 500001)) (and .cse0 (<= 500000 v_main_~x~0_443) (= |v_main_#t~post4_99| |v_main_#t~post4_100|)) (and .cse0 (= |v_main_#t~post4_100| |v_main_#t~post4_99|)))) InVars {main_~x~0=v_main_~x~0_443, main_#t~post4=|v_main_#t~post4_100|} OutVars{main_~x~0=v_main_~x~0_442, main_#t~post4=|v_main_#t~post4_99|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {6891#(<= main_~x~0 500000)} [133] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {6891#(<= main_~x~0 500000)} [134] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_168| |v_main_#t~post6_166|)) (.cse1 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse2 (= v_main_~y~0_297 v_main_~y~0_296)) (.cse3 (<= 750000 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_444 (* v_main_~y~0_297 2)) (+ v_main_~x~0_445 (* v_main_~y~0_296 2))) .cse3 (< v_main_~y~0_297 v_main_~y~0_296) (< v_main_~y~0_296 (+ v_main_~y~0_297 (div (+ (* v_main_~x~0_445 (- 1)) 999999) 2) 2))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_445 1000000)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_297, main_~x~0=v_main_~x~0_445, main_#t~post6=|v_main_#t~post6_168|} OutVars{main_~y~0=v_main_~y~0_296, main_~x~0=v_main_~x~0_444, main_#t~post6=|v_main_#t~post6_166|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {6891#(<= main_~x~0 500000)} [135] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {6891#(<= main_~x~0 500000)} [136] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse1 (= |v_main_#t~post6_171| |v_main_#t~post6_167|)) (.cse2 (= |v_main_#t~post5_83| |v_main_#t~post5_82|)) (.cse3 (= v_main_~y~0_299 v_main_~y~0_298)) (.cse4 (<= 500000 v_main_~x~0_447))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_447 750000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_447 v_main_~y~0_298))) (and (< .cse5 (+ 750001 v_main_~y~0_299)) .cse4 (< v_main_~y~0_299 v_main_~y~0_298) (= .cse5 (+ v_main_~x~0_446 v_main_~y~0_299)))))) InVars {main_~y~0=v_main_~y~0_299, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_447, main_#t~post6=|v_main_#t~post6_171|} OutVars{main_~y~0=v_main_~y~0_298, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_446, main_#t~post6=|v_main_#t~post6_167|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6892#(<= main_~x~0 750000)} is VALID [2022-04-15 06:51:03,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {6892#(<= main_~x~0 750000)} [131] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {6886#false} is VALID [2022-04-15 06:51:03,519 INFO L272 TraceCheckUtils]: 12: Hoare triple {6886#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {6886#false} is VALID [2022-04-15 06:51:03,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {6886#false} ~cond := #in~cond; {6886#false} is VALID [2022-04-15 06:51:03,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {6886#false} assume 0 == ~cond; {6886#false} is VALID [2022-04-15 06:51:03,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {6886#false} assume !false; {6886#false} is VALID [2022-04-15 06:51:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:03,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38824375] [2022-04-15 06:51:03,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38824375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:03,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122709604] [2022-04-15 06:51:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:03,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:03,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:03,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:51:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:03,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:51:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:03,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:03,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6885#true} is VALID [2022-04-15 06:51:03,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {6885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6885#true} is VALID [2022-04-15 06:51:03,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-15 06:51:03,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #48#return; {6885#true} is VALID [2022-04-15 06:51:03,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret7 := main(); {6885#true} is VALID [2022-04-15 06:51:03,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6912#(<= main_~x~0 0)} is VALID [2022-04-15 06:51:03,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {6912#(<= main_~x~0 0)} [132] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_443 v_main_~x~0_442))) (or (and (< v_main_~x~0_443 v_main_~x~0_442) (< v_main_~x~0_442 500001)) (and .cse0 (<= 500000 v_main_~x~0_443) (= |v_main_#t~post4_99| |v_main_#t~post4_100|)) (and .cse0 (= |v_main_#t~post4_100| |v_main_#t~post4_99|)))) InVars {main_~x~0=v_main_~x~0_443, main_#t~post4=|v_main_#t~post4_100|} OutVars{main_~x~0=v_main_~x~0_442, main_#t~post4=|v_main_#t~post4_99|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {6891#(<= main_~x~0 500000)} [133] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {6891#(<= main_~x~0 500000)} [134] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_168| |v_main_#t~post6_166|)) (.cse1 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse2 (= v_main_~y~0_297 v_main_~y~0_296)) (.cse3 (<= 750000 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_444 (* v_main_~y~0_297 2)) (+ v_main_~x~0_445 (* v_main_~y~0_296 2))) .cse3 (< v_main_~y~0_297 v_main_~y~0_296) (< v_main_~y~0_296 (+ v_main_~y~0_297 (div (+ (* v_main_~x~0_445 (- 1)) 999999) 2) 2))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_445 1000000)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_297, main_~x~0=v_main_~x~0_445, main_#t~post6=|v_main_#t~post6_168|} OutVars{main_~y~0=v_main_~y~0_296, main_~x~0=v_main_~x~0_444, main_#t~post6=|v_main_#t~post6_166|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {6891#(<= main_~x~0 500000)} [135] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6891#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:03,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {6891#(<= main_~x~0 500000)} [136] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse1 (= |v_main_#t~post6_171| |v_main_#t~post6_167|)) (.cse2 (= |v_main_#t~post5_83| |v_main_#t~post5_82|)) (.cse3 (= v_main_~y~0_299 v_main_~y~0_298)) (.cse4 (<= 500000 v_main_~x~0_447))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_447 750000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_447 v_main_~y~0_298))) (and (< .cse5 (+ 750001 v_main_~y~0_299)) .cse4 (< v_main_~y~0_299 v_main_~y~0_298) (= .cse5 (+ v_main_~x~0_446 v_main_~y~0_299)))))) InVars {main_~y~0=v_main_~y~0_299, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_447, main_#t~post6=|v_main_#t~post6_171|} OutVars{main_~y~0=v_main_~y~0_298, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_446, main_#t~post6=|v_main_#t~post6_167|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6892#(<= main_~x~0 750000)} is VALID [2022-04-15 06:51:03,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {6892#(<= main_~x~0 750000)} [131] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {6886#false} is VALID [2022-04-15 06:51:03,716 INFO L272 TraceCheckUtils]: 12: Hoare triple {6886#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {6886#false} is VALID [2022-04-15 06:51:03,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {6886#false} ~cond := #in~cond; {6886#false} is VALID [2022-04-15 06:51:03,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {6886#false} assume 0 == ~cond; {6886#false} is VALID [2022-04-15 06:51:03,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {6886#false} assume !false; {6886#false} is VALID [2022-04-15 06:51:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:03,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:15,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {6886#false} assume !false; {6886#false} is VALID [2022-04-15 06:51:15,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {6946#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6886#false} is VALID [2022-04-15 06:51:15,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {6950#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6946#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:51:15,118 INFO L272 TraceCheckUtils]: 12: Hoare triple {6954#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {6950#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:51:15,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {6958#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [131] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {6954#(= main_~x~0 1000000)} is VALID [2022-04-15 06:51:15,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {6958#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [136] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_447 v_main_~x~0_446)) (.cse1 (= |v_main_#t~post6_171| |v_main_#t~post6_167|)) (.cse2 (= |v_main_#t~post5_83| |v_main_#t~post5_82|)) (.cse3 (= v_main_~y~0_299 v_main_~y~0_298)) (.cse4 (<= 500000 v_main_~x~0_447))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_447 750000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_447 v_main_~y~0_298))) (and (< .cse5 (+ 750001 v_main_~y~0_299)) .cse4 (< v_main_~y~0_299 v_main_~y~0_298) (= .cse5 (+ v_main_~x~0_446 v_main_~y~0_299)))))) InVars {main_~y~0=v_main_~y~0_299, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_447, main_#t~post6=|v_main_#t~post6_171|} OutVars{main_~y~0=v_main_~y~0_298, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_446, main_#t~post6=|v_main_#t~post6_167|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6958#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:15,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {6958#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [135] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6958#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:15,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {6968#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [134] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_168| |v_main_#t~post6_166|)) (.cse1 (= v_main_~x~0_445 v_main_~x~0_444)) (.cse2 (= v_main_~y~0_297 v_main_~y~0_296)) (.cse3 (<= 750000 v_main_~x~0_445))) (or (and .cse0 .cse1 .cse2) (and (= (+ v_main_~x~0_444 (* v_main_~y~0_297 2)) (+ v_main_~x~0_445 (* v_main_~y~0_296 2))) .cse3 (< v_main_~y~0_297 v_main_~y~0_296) (< v_main_~y~0_296 (+ v_main_~y~0_297 (div (+ (* v_main_~x~0_445 (- 1)) 999999) 2) 2))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_445 1000000)) (not .cse3))))) InVars {main_~y~0=v_main_~y~0_297, main_~x~0=v_main_~x~0_445, main_#t~post6=|v_main_#t~post6_168|} OutVars{main_~y~0=v_main_~y~0_296, main_~x~0=v_main_~x~0_444, main_#t~post6=|v_main_#t~post6_166|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {6958#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:15,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {6968#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [133] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6968#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:15,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {6968#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [132] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_443 v_main_~x~0_442))) (or (and (< v_main_~x~0_443 v_main_~x~0_442) (< v_main_~x~0_442 500001)) (and .cse0 (<= 500000 v_main_~x~0_443) (= |v_main_#t~post4_99| |v_main_#t~post4_100|)) (and .cse0 (= |v_main_#t~post4_100| |v_main_#t~post4_99|)))) InVars {main_~x~0=v_main_~x~0_443, main_#t~post4=|v_main_#t~post4_100|} OutVars{main_~x~0=v_main_~x~0_442, main_#t~post4=|v_main_#t~post4_99|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6968#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:15,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6968#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:15,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret7 := main(); {6885#true} is VALID [2022-04-15 06:51:15,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #48#return; {6885#true} is VALID [2022-04-15 06:51:15,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-15 06:51:15,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {6885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {6885#true} is VALID [2022-04-15 06:51:15,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6885#true} is VALID [2022-04-15 06:51:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:15,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122709604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:15,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:15,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:51:15,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:15,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253199164] [2022-04-15 06:51:15,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253199164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:15,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:15,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:51:15,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903349123] [2022-04-15 06:51:15,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:51:15,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:15,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:15,659 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 06:51:15,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:51:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:51:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:51:15,660 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:17,727 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-04-15 06:51:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:51:17,727 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 06:51:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2022-04-15 06:51:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 92 transitions. [2022-04-15 06:51:17,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 92 transitions. [2022-04-15 06:51:17,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:17,801 INFO L225 Difference]: With dead ends: 103 [2022-04-15 06:51:17,801 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 06:51:17,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1812, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:51:17,802 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 57 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:17,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 103 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:51:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 06:51:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2022-04-15 06:51:18,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:18,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:18,245 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:18,245 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,247 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-04-15 06:51:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-04-15 06:51:18,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:18,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:18,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 06:51:18,248 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 06:51:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,249 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-04-15 06:51:18,249 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-04-15 06:51:18,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:18,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:18,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:18,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-04-15 06:51:18,251 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 73 [2022-04-15 06:51:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:18,251 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-04-15 06:51:18,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:18,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2022-04-15 06:51:18,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:18,372 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-04-15 06:51:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 06:51:18,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:18,372 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:18,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 06:51:18,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:18,573 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1488345401, now seen corresponding path program 14 times [2022-04-15 06:51:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:18,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [475582202] [2022-04-15 06:51:18,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:21,687 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:21,829 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:22,113 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:22,114 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1949921831, now seen corresponding path program 1 times [2022-04-15 06:51:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:22,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775925402] [2022-04-15 06:51:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:22,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {7590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7582#true} is VALID [2022-04-15 06:51:22,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {7582#true} assume true; {7582#true} is VALID [2022-04-15 06:51:22,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7582#true} {7582#true} #48#return; {7582#true} is VALID [2022-04-15 06:51:22,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {7582#true} call ULTIMATE.init(); {7590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:22,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {7590#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7582#true} is VALID [2022-04-15 06:51:22,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#true} assume true; {7582#true} is VALID [2022-04-15 06:51:22,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7582#true} {7582#true} #48#return; {7582#true} is VALID [2022-04-15 06:51:22,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {7582#true} call #t~ret7 := main(); {7582#true} is VALID [2022-04-15 06:51:22,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {7582#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7587#(= main_~x~0 0)} is VALID [2022-04-15 06:51:22,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {7587#(= main_~x~0 0)} [138] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_107| |v_main_#t~post4_106|)) (.cse1 (= v_main_~x~0_483 v_main_~x~0_482))) (or (and .cse0 (not (< v_main_~x~0_483 500000)) .cse1) (and (< v_main_~x~0_483 v_main_~x~0_482) (< v_main_~x~0_482 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_483, main_#t~post4=|v_main_#t~post4_107|} OutVars{main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_106|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {7588#(<= main_~x~0 500000)} [139] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {7588#(<= main_~x~0 500000)} [140] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse1 (= v_main_~x~0_485 v_main_~x~0_484)) (.cse2 (<= 750000 v_main_~x~0_485))) (or (and (= |v_main_#t~post6_181| |v_main_#t~post6_179|) .cse0 .cse1) (and (or (not (< v_main_~x~0_485 1000000)) (not .cse2)) .cse0 .cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_181|)) (and (< v_main_~y~0_326 (+ (div (+ (* v_main_~x~0_485 (- 1)) 999999) 2) v_main_~y~0_327 2)) .cse2 (= (+ v_main_~x~0_484 (* v_main_~y~0_327 2)) (+ v_main_~x~0_485 (* v_main_~y~0_326 2))) (< v_main_~y~0_327 v_main_~y~0_326)))) InVars {main_~y~0=v_main_~y~0_327, main_~x~0=v_main_~x~0_485, main_#t~post6=|v_main_#t~post6_181|} OutVars{main_~y~0=v_main_~y~0_326, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {7588#(<= main_~x~0 500000)} [141] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {7588#(<= main_~x~0 500000)} [142] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_487)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_329 v_main_~y~0_328)) (.cse3 (= v_main_~x~0_487 v_main_~x~0_486)) (.cse4 (= |v_main_#t~post6_184| |v_main_#t~post6_180|))) (or (and (< v_main_~x~0_486 750001) (< v_main_~x~0_487 v_main_~x~0_486) (= (+ v_main_~x~0_487 v_main_~y~0_328) (+ v_main_~x~0_486 v_main_~y~0_329)) .cse0) (and (or (not .cse0) (not (< v_main_~x~0_487 750000))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_329, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_487, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_486, main_#t~post6=|v_main_#t~post6_180|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7589#(<= main_~x~0 750000)} is VALID [2022-04-15 06:51:22,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {7589#(<= main_~x~0 750000)} [137] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {7583#false} is VALID [2022-04-15 06:51:22,170 INFO L272 TraceCheckUtils]: 12: Hoare triple {7583#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {7583#false} is VALID [2022-04-15 06:51:22,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#false} ~cond := #in~cond; {7583#false} is VALID [2022-04-15 06:51:22,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#false} assume 0 == ~cond; {7583#false} is VALID [2022-04-15 06:51:22,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#false} assume !false; {7583#false} is VALID [2022-04-15 06:51:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:22,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775925402] [2022-04-15 06:51:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775925402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505833414] [2022-04-15 06:51:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:22,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:22,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:22,174 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:22,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:51:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:22,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:51:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:22,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:22,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {7582#true} call ULTIMATE.init(); {7582#true} is VALID [2022-04-15 06:51:22,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {7582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7582#true} is VALID [2022-04-15 06:51:22,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#true} assume true; {7582#true} is VALID [2022-04-15 06:51:22,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7582#true} {7582#true} #48#return; {7582#true} is VALID [2022-04-15 06:51:22,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {7582#true} call #t~ret7 := main(); {7582#true} is VALID [2022-04-15 06:51:22,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {7582#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7609#(<= main_~x~0 0)} is VALID [2022-04-15 06:51:22,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {7609#(<= main_~x~0 0)} [138] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_107| |v_main_#t~post4_106|)) (.cse1 (= v_main_~x~0_483 v_main_~x~0_482))) (or (and .cse0 (not (< v_main_~x~0_483 500000)) .cse1) (and (< v_main_~x~0_483 v_main_~x~0_482) (< v_main_~x~0_482 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_483, main_#t~post4=|v_main_#t~post4_107|} OutVars{main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_106|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {7588#(<= main_~x~0 500000)} [139] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {7588#(<= main_~x~0 500000)} [140] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse1 (= v_main_~x~0_485 v_main_~x~0_484)) (.cse2 (<= 750000 v_main_~x~0_485))) (or (and (= |v_main_#t~post6_181| |v_main_#t~post6_179|) .cse0 .cse1) (and (or (not (< v_main_~x~0_485 1000000)) (not .cse2)) .cse0 .cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_181|)) (and (< v_main_~y~0_326 (+ (div (+ (* v_main_~x~0_485 (- 1)) 999999) 2) v_main_~y~0_327 2)) .cse2 (= (+ v_main_~x~0_484 (* v_main_~y~0_327 2)) (+ v_main_~x~0_485 (* v_main_~y~0_326 2))) (< v_main_~y~0_327 v_main_~y~0_326)))) InVars {main_~y~0=v_main_~y~0_327, main_~x~0=v_main_~x~0_485, main_#t~post6=|v_main_#t~post6_181|} OutVars{main_~y~0=v_main_~y~0_326, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {7588#(<= main_~x~0 500000)} [141] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7588#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:22,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {7588#(<= main_~x~0 500000)} [142] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_487)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_329 v_main_~y~0_328)) (.cse3 (= v_main_~x~0_487 v_main_~x~0_486)) (.cse4 (= |v_main_#t~post6_184| |v_main_#t~post6_180|))) (or (and (< v_main_~x~0_486 750001) (< v_main_~x~0_487 v_main_~x~0_486) (= (+ v_main_~x~0_487 v_main_~y~0_328) (+ v_main_~x~0_486 v_main_~y~0_329)) .cse0) (and (or (not .cse0) (not (< v_main_~x~0_487 750000))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_329, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_487, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_486, main_#t~post6=|v_main_#t~post6_180|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7589#(<= main_~x~0 750000)} is VALID [2022-04-15 06:51:22,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {7589#(<= main_~x~0 750000)} [137] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {7583#false} is VALID [2022-04-15 06:51:22,357 INFO L272 TraceCheckUtils]: 12: Hoare triple {7583#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {7583#false} is VALID [2022-04-15 06:51:22,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#false} ~cond := #in~cond; {7583#false} is VALID [2022-04-15 06:51:22,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#false} assume 0 == ~cond; {7583#false} is VALID [2022-04-15 06:51:22,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#false} assume !false; {7583#false} is VALID [2022-04-15 06:51:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:22,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:33,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#false} assume !false; {7583#false} is VALID [2022-04-15 06:51:33,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {7643#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7583#false} is VALID [2022-04-15 06:51:33,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {7647#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7643#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:51:33,721 INFO L272 TraceCheckUtils]: 12: Hoare triple {7651#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {7647#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:51:33,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {7655#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [137] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {7651#(= main_~x~0 1000000)} is VALID [2022-04-15 06:51:33,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {7655#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [142] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_487)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_329 v_main_~y~0_328)) (.cse3 (= v_main_~x~0_487 v_main_~x~0_486)) (.cse4 (= |v_main_#t~post6_184| |v_main_#t~post6_180|))) (or (and (< v_main_~x~0_486 750001) (< v_main_~x~0_487 v_main_~x~0_486) (= (+ v_main_~x~0_487 v_main_~y~0_328) (+ v_main_~x~0_486 v_main_~y~0_329)) .cse0) (and (or (not .cse0) (not (< v_main_~x~0_487 750000))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_329, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_487, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_328, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_486, main_#t~post6=|v_main_#t~post6_180|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7655#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:33,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {7655#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [141] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7655#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:33,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {7665#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [140] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_327 v_main_~y~0_326)) (.cse1 (= v_main_~x~0_485 v_main_~x~0_484)) (.cse2 (<= 750000 v_main_~x~0_485))) (or (and (= |v_main_#t~post6_181| |v_main_#t~post6_179|) .cse0 .cse1) (and (or (not (< v_main_~x~0_485 1000000)) (not .cse2)) .cse0 .cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_181|)) (and (< v_main_~y~0_326 (+ (div (+ (* v_main_~x~0_485 (- 1)) 999999) 2) v_main_~y~0_327 2)) .cse2 (= (+ v_main_~x~0_484 (* v_main_~y~0_327 2)) (+ v_main_~x~0_485 (* v_main_~y~0_326 2))) (< v_main_~y~0_327 v_main_~y~0_326)))) InVars {main_~y~0=v_main_~y~0_327, main_~x~0=v_main_~x~0_485, main_#t~post6=|v_main_#t~post6_181|} OutVars{main_~y~0=v_main_~y~0_326, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {7655#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:33,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {7665#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [139] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7665#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:33,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {7665#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [138] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_107| |v_main_#t~post4_106|)) (.cse1 (= v_main_~x~0_483 v_main_~x~0_482))) (or (and .cse0 (not (< v_main_~x~0_483 500000)) .cse1) (and (< v_main_~x~0_483 v_main_~x~0_482) (< v_main_~x~0_482 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_483, main_#t~post4=|v_main_#t~post4_107|} OutVars{main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_106|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7665#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:33,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {7582#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7665#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:33,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {7582#true} call #t~ret7 := main(); {7582#true} is VALID [2022-04-15 06:51:33,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7582#true} {7582#true} #48#return; {7582#true} is VALID [2022-04-15 06:51:33,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {7582#true} assume true; {7582#true} is VALID [2022-04-15 06:51:33,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {7582#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {7582#true} is VALID [2022-04-15 06:51:33,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {7582#true} call ULTIMATE.init(); {7582#true} is VALID [2022-04-15 06:51:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:33,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505833414] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:33,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:33,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:51:34,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:34,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [475582202] [2022-04-15 06:51:34,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [475582202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:34,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:34,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:51:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950580892] [2022-04-15 06:51:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 06:51:34,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:34,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:34,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:34,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:51:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:51:34,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:51:34,286 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:36,678 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-04-15 06:51:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:51:36,678 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 06:51:36,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 96 transitions. [2022-04-15 06:51:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 96 transitions. [2022-04-15 06:51:36,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 96 transitions. [2022-04-15 06:51:36,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:36,767 INFO L225 Difference]: With dead ends: 107 [2022-04-15 06:51:36,767 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 06:51:36,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=1986, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:51:36,768 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:36,768 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 114 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:51:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 06:51:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2022-04-15 06:51:37,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:37,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:37,251 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:37,251 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:37,252 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 06:51:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:51:37,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:37,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:37,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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 89 states. [2022-04-15 06:51:37,252 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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 89 states. [2022-04-15 06:51:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:37,254 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-15 06:51:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-15 06:51:37,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:37,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:37,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:37,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-04-15 06:51:37,256 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 77 [2022-04-15 06:51:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:37,256 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-04-15 06:51:37,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 20 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:37,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2022-04-15 06:51:37,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 06:51:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 06:51:37,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:37,404 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:37,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:51:37,611 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,SelfDestructingSolverStorable16 [2022-04-15 06:51:37,611 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1539773424, now seen corresponding path program 15 times [2022-04-15 06:51:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:37,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [310111379] [2022-04-15 06:51:41,676 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:41,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:41,983 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:42,247 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:42,248 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:42,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1590346855, now seen corresponding path program 1 times [2022-04-15 06:51:42,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:42,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686504323] [2022-04-15 06:51:42,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:42,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:42,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:42,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {8314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8306#true} is VALID [2022-04-15 06:51:42,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {8306#true} assume true; {8306#true} is VALID [2022-04-15 06:51:42,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8306#true} {8306#true} #48#return; {8306#true} is VALID [2022-04-15 06:51:42,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {8306#true} call ULTIMATE.init(); {8314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:42,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {8314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8306#true} is VALID [2022-04-15 06:51:42,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {8306#true} assume true; {8306#true} is VALID [2022-04-15 06:51:42,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8306#true} {8306#true} #48#return; {8306#true} is VALID [2022-04-15 06:51:42,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {8306#true} call #t~ret7 := main(); {8306#true} is VALID [2022-04-15 06:51:42,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {8306#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8311#(= main_~x~0 0)} is VALID [2022-04-15 06:51:42,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {8311#(= main_~x~0 0)} [144] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_114| |v_main_#t~post4_113|)) (.cse1 (= v_main_~x~0_524 v_main_~x~0_523))) (or (and .cse0 .cse1) (and (< v_main_~x~0_523 500001) (< v_main_~x~0_524 v_main_~x~0_523)) (and (not (< v_main_~x~0_524 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_524, main_#t~post4=|v_main_#t~post4_114|} OutVars{main_~x~0=v_main_~x~0_523, main_#t~post4=|v_main_#t~post4_113|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8312#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:42,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {8312#(<= main_~x~0 500000)} [145] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8312#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:42,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {8312#(<= main_~x~0 500000)} [146] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_526 v_main_~x~0_525)) (.cse0 (<= 750000 v_main_~x~0_526)) (.cse2 (= |v_main_#t~post6_194| |v_main_#t~post6_192|)) (.cse3 (= v_main_~y~0_358 v_main_~y~0_357))) (or (and (< v_main_~y~0_358 v_main_~y~0_357) (= (+ v_main_~x~0_526 (* v_main_~y~0_357 2)) (+ v_main_~x~0_525 (* v_main_~y~0_358 2))) .cse0 (< v_main_~y~0_357 (+ (div (+ 999999 (* v_main_~x~0_526 (- 1))) 2) v_main_~y~0_358 2))) (and .cse1 .cse2 .cse3) (and .cse1 (or (not (< v_main_~x~0_526 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_358, main_~x~0=v_main_~x~0_526, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_357, main_~x~0=v_main_~x~0_525, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {8313#(<= main_~x~0 999999)} is VALID [2022-04-15 06:51:42,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {8313#(<= main_~x~0 999999)} [147] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8313#(<= main_~x~0 999999)} is VALID [2022-04-15 06:51:42,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {8313#(<= main_~x~0 999999)} [148] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_528)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= |v_main_#t~post6_197| |v_main_#t~post6_193|)) (.cse3 (= v_main_~x~0_528 v_main_~x~0_527))) (or (and .cse0 .cse1 (= v_main_~y~0_359 v_main_~y~0_360) (or (not (< v_main_~x~0_528 750000)) (not .cse2)) .cse3) (and (< v_main_~x~0_528 v_main_~x~0_527) .cse2 (= (+ v_main_~x~0_528 v_main_~y~0_359) (+ v_main_~x~0_527 v_main_~y~0_360)) (< v_main_~x~0_527 750001)) (and .cse0 .cse1 (= v_main_~y~0_360 v_main_~y~0_359) .cse3))) InVars {main_~y~0=v_main_~y~0_360, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_528, main_#t~post6=|v_main_#t~post6_197|} OutVars{main_~y~0=v_main_~y~0_359, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_527, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8313#(<= main_~x~0 999999)} is VALID [2022-04-15 06:51:42,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {8313#(<= main_~x~0 999999)} [143] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {8307#false} is VALID [2022-04-15 06:51:42,314 INFO L272 TraceCheckUtils]: 12: Hoare triple {8307#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {8307#false} is VALID [2022-04-15 06:51:42,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {8307#false} ~cond := #in~cond; {8307#false} is VALID [2022-04-15 06:51:42,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {8307#false} assume 0 == ~cond; {8307#false} is VALID [2022-04-15 06:51:42,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {8307#false} assume !false; {8307#false} is VALID [2022-04-15 06:51:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:51:42,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:42,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686504323] [2022-04-15 06:51:42,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686504323] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:42,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263410155] [2022-04-15 06:51:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:42,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:42,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:42,317 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:42,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:51:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:42,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:51:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:42,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:42,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {8306#true} call ULTIMATE.init(); {8306#true} is VALID [2022-04-15 06:51:42,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {8306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8306#true} is VALID [2022-04-15 06:51:42,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {8306#true} assume true; {8306#true} is VALID [2022-04-15 06:51:42,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8306#true} {8306#true} #48#return; {8306#true} is VALID [2022-04-15 06:51:42,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {8306#true} call #t~ret7 := main(); {8306#true} is VALID [2022-04-15 06:51:42,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {8306#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8333#(<= main_~x~0 0)} is VALID [2022-04-15 06:51:42,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {8333#(<= main_~x~0 0)} [144] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_114| |v_main_#t~post4_113|)) (.cse1 (= v_main_~x~0_524 v_main_~x~0_523))) (or (and .cse0 .cse1) (and (< v_main_~x~0_523 500001) (< v_main_~x~0_524 v_main_~x~0_523)) (and (not (< v_main_~x~0_524 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_524, main_#t~post4=|v_main_#t~post4_114|} OutVars{main_~x~0=v_main_~x~0_523, main_#t~post4=|v_main_#t~post4_113|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8312#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:42,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {8312#(<= main_~x~0 500000)} [145] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8312#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:42,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {8312#(<= main_~x~0 500000)} [146] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_526 v_main_~x~0_525)) (.cse0 (<= 750000 v_main_~x~0_526)) (.cse2 (= |v_main_#t~post6_194| |v_main_#t~post6_192|)) (.cse3 (= v_main_~y~0_358 v_main_~y~0_357))) (or (and (< v_main_~y~0_358 v_main_~y~0_357) (= (+ v_main_~x~0_526 (* v_main_~y~0_357 2)) (+ v_main_~x~0_525 (* v_main_~y~0_358 2))) .cse0 (< v_main_~y~0_357 (+ (div (+ 999999 (* v_main_~x~0_526 (- 1))) 2) v_main_~y~0_358 2))) (and .cse1 .cse2 .cse3) (and .cse1 (or (not (< v_main_~x~0_526 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_358, main_~x~0=v_main_~x~0_526, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_357, main_~x~0=v_main_~x~0_525, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {8312#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:42,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {8312#(<= main_~x~0 500000)} [147] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8312#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:42,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {8312#(<= main_~x~0 500000)} [148] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_528)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= |v_main_#t~post6_197| |v_main_#t~post6_193|)) (.cse3 (= v_main_~x~0_528 v_main_~x~0_527))) (or (and .cse0 .cse1 (= v_main_~y~0_359 v_main_~y~0_360) (or (not (< v_main_~x~0_528 750000)) (not .cse2)) .cse3) (and (< v_main_~x~0_528 v_main_~x~0_527) .cse2 (= (+ v_main_~x~0_528 v_main_~y~0_359) (+ v_main_~x~0_527 v_main_~y~0_360)) (< v_main_~x~0_527 750001)) (and .cse0 .cse1 (= v_main_~y~0_360 v_main_~y~0_359) .cse3))) InVars {main_~y~0=v_main_~y~0_360, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_528, main_#t~post6=|v_main_#t~post6_197|} OutVars{main_~y~0=v_main_~y~0_359, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_527, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8349#(< main_~x~0 750001)} is VALID [2022-04-15 06:51:42,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {8349#(< main_~x~0 750001)} [143] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {8307#false} is VALID [2022-04-15 06:51:42,535 INFO L272 TraceCheckUtils]: 12: Hoare triple {8307#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {8307#false} is VALID [2022-04-15 06:51:42,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {8307#false} ~cond := #in~cond; {8307#false} is VALID [2022-04-15 06:51:42,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {8307#false} assume 0 == ~cond; {8307#false} is VALID [2022-04-15 06:51:42,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {8307#false} assume !false; {8307#false} is VALID [2022-04-15 06:51:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:42,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:43,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {8307#false} assume !false; {8307#false} is VALID [2022-04-15 06:51:43,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {8368#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8307#false} is VALID [2022-04-15 06:51:43,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {8372#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8368#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:51:43,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {8376#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {8372#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:51:43,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {8380#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [143] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {8376#(= main_~x~0 1000000)} is VALID [2022-04-15 06:51:43,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {8380#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [148] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_528)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= |v_main_#t~post6_197| |v_main_#t~post6_193|)) (.cse3 (= v_main_~x~0_528 v_main_~x~0_527))) (or (and .cse0 .cse1 (= v_main_~y~0_359 v_main_~y~0_360) (or (not (< v_main_~x~0_528 750000)) (not .cse2)) .cse3) (and (< v_main_~x~0_528 v_main_~x~0_527) .cse2 (= (+ v_main_~x~0_528 v_main_~y~0_359) (+ v_main_~x~0_527 v_main_~y~0_360)) (< v_main_~x~0_527 750001)) (and .cse0 .cse1 (= v_main_~y~0_360 v_main_~y~0_359) .cse3))) InVars {main_~y~0=v_main_~y~0_360, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_528, main_#t~post6=|v_main_#t~post6_197|} OutVars{main_~y~0=v_main_~y~0_359, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_527, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8380#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:43,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {8380#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [147] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8380#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:43,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {8390#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [146] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_526 v_main_~x~0_525)) (.cse0 (<= 750000 v_main_~x~0_526)) (.cse2 (= |v_main_#t~post6_194| |v_main_#t~post6_192|)) (.cse3 (= v_main_~y~0_358 v_main_~y~0_357))) (or (and (< v_main_~y~0_358 v_main_~y~0_357) (= (+ v_main_~x~0_526 (* v_main_~y~0_357 2)) (+ v_main_~x~0_525 (* v_main_~y~0_358 2))) .cse0 (< v_main_~y~0_357 (+ (div (+ 999999 (* v_main_~x~0_526 (- 1))) 2) v_main_~y~0_358 2))) (and .cse1 .cse2 .cse3) (and .cse1 (or (not (< v_main_~x~0_526 1000000)) (not .cse0)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_358, main_~x~0=v_main_~x~0_526, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_357, main_~x~0=v_main_~x~0_525, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {8380#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:51:43,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {8390#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [145] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8390#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:43,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {8390#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [144] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_114| |v_main_#t~post4_113|)) (.cse1 (= v_main_~x~0_524 v_main_~x~0_523))) (or (and .cse0 .cse1) (and (< v_main_~x~0_523 500001) (< v_main_~x~0_524 v_main_~x~0_523)) (and (not (< v_main_~x~0_524 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_524, main_#t~post4=|v_main_#t~post4_114|} OutVars{main_~x~0=v_main_~x~0_523, main_#t~post4=|v_main_#t~post4_113|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8390#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:43,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {8306#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8390#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:51:43,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {8306#true} call #t~ret7 := main(); {8306#true} is VALID [2022-04-15 06:51:43,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8306#true} {8306#true} #48#return; {8306#true} is VALID [2022-04-15 06:51:43,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {8306#true} assume true; {8306#true} is VALID [2022-04-15 06:51:43,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {8306#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {8306#true} is VALID [2022-04-15 06:51:43,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {8306#true} call ULTIMATE.init(); {8306#true} is VALID [2022-04-15 06:51:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:43,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263410155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:43,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:43,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:51:43,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:43,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [310111379] [2022-04-15 06:51:43,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [310111379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:43,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:43,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:51:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286585957] [2022-04-15 06:51:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:43,885 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 06:51:43,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:43,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:43,939 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 06:51:43,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:51:43,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:51:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:51:43,940 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:46,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:46,528 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-04-15 06:51:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:51:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 06:51:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 100 transitions. [2022-04-15 06:51:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 100 transitions. [2022-04-15 06:51:46,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 100 transitions. [2022-04-15 06:51:46,629 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 06:51:46,630 INFO L225 Difference]: With dead ends: 111 [2022-04-15 06:51:46,630 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 06:51:46,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=2223, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:51:46,632 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:46,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 115 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:51:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 06:51:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-04-15 06:51:47,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:47,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:47,181 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:47,181 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:47,182 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-15 06:51:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-15 06:51:47,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:47,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:47,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 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 93 states. [2022-04-15 06:51:47,183 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 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 93 states. [2022-04-15 06:51:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:47,184 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-04-15 06:51:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-04-15 06:51:47,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:47,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:47,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:47,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-04-15 06:51:47,186 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 81 [2022-04-15 06:51:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:47,186 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-04-15 06:51:47,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 21 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:47,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2022-04-15 06:51:47,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 06:51:47,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 06:51:47,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:47,353 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:47,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 06:51:47,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:51:47,554 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:47,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1945647975, now seen corresponding path program 16 times [2022-04-15 06:51:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:47,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550742965] [2022-04-15 06:51:51,637 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:51,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:51,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:56,074 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:56,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:56,199 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1230771879, now seen corresponding path program 1 times [2022-04-15 06:51:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:56,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581394751] [2022-04-15 06:51:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:56,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:56,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:56,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {9066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9058#true} is VALID [2022-04-15 06:51:56,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {9058#true} assume true; {9058#true} is VALID [2022-04-15 06:51:56,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9058#true} {9058#true} #48#return; {9058#true} is VALID [2022-04-15 06:51:56,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {9058#true} call ULTIMATE.init(); {9066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:56,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {9066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9058#true} is VALID [2022-04-15 06:51:56,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {9058#true} assume true; {9058#true} is VALID [2022-04-15 06:51:56,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9058#true} {9058#true} #48#return; {9058#true} is VALID [2022-04-15 06:51:56,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {9058#true} call #t~ret7 := main(); {9058#true} is VALID [2022-04-15 06:51:56,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {9058#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9063#(= main_~x~0 0)} is VALID [2022-04-15 06:51:56,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {9063#(= main_~x~0 0)} [150] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_566 v_main_~x~0_565)) (.cse1 (= |v_main_#t~post4_121| |v_main_#t~post4_120|))) (or (and (<= 500000 v_main_~x~0_566) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_565 500001) (< v_main_~x~0_566 v_main_~x~0_565)))) InVars {main_~x~0=v_main_~x~0_566, main_#t~post4=|v_main_#t~post4_121|} OutVars{main_~x~0=v_main_~x~0_565, main_#t~post4=|v_main_#t~post4_120|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9064#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:56,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {9064#(<= main_~x~0 500000)} [151] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9064#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:56,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {9064#(<= main_~x~0 500000)} [152] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_568)) (.cse1 (= |v_main_#t~post6_207| |v_main_#t~post6_205|)) (.cse2 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (< v_main_~y~0_390 v_main_~y~0_389) (< v_main_~y~0_389 (+ (div (+ 999999 (* v_main_~x~0_568 (- 1))) 2) v_main_~y~0_390 2)) .cse0 (= (+ v_main_~x~0_568 (* v_main_~y~0_389 2)) (+ v_main_~x~0_567 (* v_main_~y~0_390 2)))) (and (or (not (< v_main_~x~0_568 1000000)) (not .cse0)) .cse1 (= v_main_~y~0_389 v_main_~y~0_390) .cse2) (and (= v_main_~y~0_390 v_main_~y~0_389) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_390, main_~x~0=v_main_~x~0_568, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_389, main_~x~0=v_main_~x~0_567, main_#t~post6=|v_main_#t~post6_205|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {9064#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:56,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {9064#(<= main_~x~0 500000)} [153] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9064#(<= main_~x~0 500000)} is VALID [2022-04-15 06:51:56,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {9064#(<= main_~x~0 500000)} [154] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post5_101| |v_main_#t~post5_100|)) (.cse2 (= |v_main_#t~post6_210| |v_main_#t~post6_206|)) (.cse3 (<= 500000 v_main_~x~0_570))) (or (and .cse0 (= v_main_~x~0_570 v_main_~x~0_569) .cse1 .cse2) (and .cse0 (or (not (< v_main_~x~0_570 750000)) (not .cse3)) .cse1 (= v_main_~x~0_569 v_main_~x~0_570) .cse2) (and (< v_main_~x~0_570 v_main_~x~0_569) .cse3 (< v_main_~x~0_569 750001) (= (+ v_main_~x~0_569 v_main_~y~0_392) (+ v_main_~x~0_570 v_main_~y~0_391))))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_570, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_569, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9065#(<= main_~x~0 750000)} is VALID [2022-04-15 06:51:56,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {9065#(<= main_~x~0 750000)} [149] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {9059#false} is VALID [2022-04-15 06:51:56,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {9059#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {9059#false} is VALID [2022-04-15 06:51:56,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {9059#false} ~cond := #in~cond; {9059#false} is VALID [2022-04-15 06:51:56,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {9059#false} assume 0 == ~cond; {9059#false} is VALID [2022-04-15 06:51:56,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {9059#false} assume !false; {9059#false} is VALID [2022-04-15 06:51:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581394751] [2022-04-15 06:51:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581394751] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26227927] [2022-04-15 06:51:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:56,272 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:56,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:51:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:56,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:51:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:56,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:56,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {9058#true} call ULTIMATE.init(); {9058#true} is VALID [2022-04-15 06:51:56,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {9058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9058#true} is VALID [2022-04-15 06:51:56,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {9058#true} assume true; {9058#true} is VALID [2022-04-15 06:51:56,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9058#true} {9058#true} #48#return; {9058#true} is VALID [2022-04-15 06:51:56,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {9058#true} call #t~ret7 := main(); {9058#true} is VALID [2022-04-15 06:51:56,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {9058#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9063#(= main_~x~0 0)} is VALID [2022-04-15 06:51:56,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {9063#(= main_~x~0 0)} [150] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_566 v_main_~x~0_565)) (.cse1 (= |v_main_#t~post4_121| |v_main_#t~post4_120|))) (or (and (<= 500000 v_main_~x~0_566) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_565 500001) (< v_main_~x~0_566 v_main_~x~0_565)))) InVars {main_~x~0=v_main_~x~0_566, main_#t~post4=|v_main_#t~post4_121|} OutVars{main_~x~0=v_main_~x~0_565, main_#t~post4=|v_main_#t~post4_120|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:51:56,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [151] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:51:56,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [152] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_568)) (.cse1 (= |v_main_#t~post6_207| |v_main_#t~post6_205|)) (.cse2 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (< v_main_~y~0_390 v_main_~y~0_389) (< v_main_~y~0_389 (+ (div (+ 999999 (* v_main_~x~0_568 (- 1))) 2) v_main_~y~0_390 2)) .cse0 (= (+ v_main_~x~0_568 (* v_main_~y~0_389 2)) (+ v_main_~x~0_567 (* v_main_~y~0_390 2)))) (and (or (not (< v_main_~x~0_568 1000000)) (not .cse0)) .cse1 (= v_main_~y~0_389 v_main_~y~0_390) .cse2) (and (= v_main_~y~0_390 v_main_~y~0_389) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_390, main_~x~0=v_main_~x~0_568, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_389, main_~x~0=v_main_~x~0_567, main_#t~post6=|v_main_#t~post6_205|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:51:56,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [153] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:51:56,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {9088#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [154] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post5_101| |v_main_#t~post5_100|)) (.cse2 (= |v_main_#t~post6_210| |v_main_#t~post6_206|)) (.cse3 (<= 500000 v_main_~x~0_570))) (or (and .cse0 (= v_main_~x~0_570 v_main_~x~0_569) .cse1 .cse2) (and .cse0 (or (not (< v_main_~x~0_570 750000)) (not .cse3)) .cse1 (= v_main_~x~0_569 v_main_~x~0_570) .cse2) (and (< v_main_~x~0_570 v_main_~x~0_569) .cse3 (< v_main_~x~0_569 750001) (= (+ v_main_~x~0_569 v_main_~y~0_392) (+ v_main_~x~0_570 v_main_~y~0_391))))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_570, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_569, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9101#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:51:56,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {9101#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [149] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {9059#false} is VALID [2022-04-15 06:51:56,578 INFO L272 TraceCheckUtils]: 12: Hoare triple {9059#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {9059#false} is VALID [2022-04-15 06:51:56,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {9059#false} ~cond := #in~cond; {9059#false} is VALID [2022-04-15 06:51:56,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {9059#false} assume 0 == ~cond; {9059#false} is VALID [2022-04-15 06:51:56,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {9059#false} assume !false; {9059#false} is VALID [2022-04-15 06:51:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:56,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:09,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {9059#false} assume !false; {9059#false} is VALID [2022-04-15 06:52:09,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {9120#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9059#false} is VALID [2022-04-15 06:52:09,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {9124#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9120#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:52:09,305 INFO L272 TraceCheckUtils]: 12: Hoare triple {9128#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {9124#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:52:09,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {9132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [149] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {9128#(= main_~x~0 1000000)} is VALID [2022-04-15 06:52:09,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {9132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [154] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_392 v_main_~y~0_391)) (.cse1 (= |v_main_#t~post5_101| |v_main_#t~post5_100|)) (.cse2 (= |v_main_#t~post6_210| |v_main_#t~post6_206|)) (.cse3 (<= 500000 v_main_~x~0_570))) (or (and .cse0 (= v_main_~x~0_570 v_main_~x~0_569) .cse1 .cse2) (and .cse0 (or (not (< v_main_~x~0_570 750000)) (not .cse3)) .cse1 (= v_main_~x~0_569 v_main_~x~0_570) .cse2) (and (< v_main_~x~0_570 v_main_~x~0_569) .cse3 (< v_main_~x~0_569 750001) (= (+ v_main_~x~0_569 v_main_~y~0_392) (+ v_main_~x~0_570 v_main_~y~0_391))))) InVars {main_~y~0=v_main_~y~0_392, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_570, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_391, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_569, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:09,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {9132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [153] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:09,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {9142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [152] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_568)) (.cse1 (= |v_main_#t~post6_207| |v_main_#t~post6_205|)) (.cse2 (= v_main_~x~0_568 v_main_~x~0_567))) (or (and (< v_main_~y~0_390 v_main_~y~0_389) (< v_main_~y~0_389 (+ (div (+ 999999 (* v_main_~x~0_568 (- 1))) 2) v_main_~y~0_390 2)) .cse0 (= (+ v_main_~x~0_568 (* v_main_~y~0_389 2)) (+ v_main_~x~0_567 (* v_main_~y~0_390 2)))) (and (or (not (< v_main_~x~0_568 1000000)) (not .cse0)) .cse1 (= v_main_~y~0_389 v_main_~y~0_390) .cse2) (and (= v_main_~y~0_390 v_main_~y~0_389) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_390, main_~x~0=v_main_~x~0_568, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_389, main_~x~0=v_main_~x~0_567, main_#t~post6=|v_main_#t~post6_205|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {9132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:09,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {9142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [151] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:09,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {9142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [150] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_566 v_main_~x~0_565)) (.cse1 (= |v_main_#t~post4_121| |v_main_#t~post4_120|))) (or (and (<= 500000 v_main_~x~0_566) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_565 500001) (< v_main_~x~0_566 v_main_~x~0_565)))) InVars {main_~x~0=v_main_~x~0_566, main_#t~post4=|v_main_#t~post4_121|} OutVars{main_~x~0=v_main_~x~0_565, main_#t~post4=|v_main_#t~post4_120|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:09,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {9058#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:09,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {9058#true} call #t~ret7 := main(); {9058#true} is VALID [2022-04-15 06:52:09,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9058#true} {9058#true} #48#return; {9058#true} is VALID [2022-04-15 06:52:09,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {9058#true} assume true; {9058#true} is VALID [2022-04-15 06:52:09,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {9058#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9058#true} is VALID [2022-04-15 06:52:09,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {9058#true} call ULTIMATE.init(); {9058#true} is VALID [2022-04-15 06:52:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:09,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26227927] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:09,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:09,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:52:09,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:09,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550742965] [2022-04-15 06:52:09,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550742965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:09,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:09,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:52:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905080128] [2022-04-15 06:52:09,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 06:52:09,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:09,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:09,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:09,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:52:09,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:09,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:52:09,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:52:09,941 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:12,936 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-04-15 06:52:12,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:52:12,936 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 06:52:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2022-04-15 06:52:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2022-04-15 06:52:12,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 104 transitions. [2022-04-15 06:52:13,046 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 06:52:13,047 INFO L225 Difference]: With dead ends: 115 [2022-04-15 06:52:13,047 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 06:52:13,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=333, Invalid=2319, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:52:13,049 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 65 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:13,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 126 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:52:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 06:52:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-04-15 06:52:13,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:13,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:13,743 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:13,743 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:13,745 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-15 06:52:13,745 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-04-15 06:52:13,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:13,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:13,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 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 97 states. [2022-04-15 06:52:13,745 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 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 97 states. [2022-04-15 06:52:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:13,751 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-15 06:52:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-04-15 06:52:13,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:13,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:13,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:13,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-15 06:52:13,754 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 85 [2022-04-15 06:52:13,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:13,754 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-15 06:52:13,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 22 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:13,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-15 06:52:13,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-15 06:52:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 06:52:13,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:13,930 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:13,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:14,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:14,131 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1438513346, now seen corresponding path program 17 times [2022-04-15 06:52:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:14,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1522668544] [2022-04-15 06:52:18,209 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:18,256 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:19,843 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:23,994 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:24,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:24,134 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:24,137 INFO L85 PathProgramCache]: Analyzing trace with hash 871196903, now seen corresponding path program 1 times [2022-04-15 06:52:24,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:24,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847590360] [2022-04-15 06:52:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:24,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9836#true} is VALID [2022-04-15 06:52:24,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {9836#true} assume true; {9836#true} is VALID [2022-04-15 06:52:24,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9836#true} {9836#true} #48#return; {9836#true} is VALID [2022-04-15 06:52:24,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {9836#true} call ULTIMATE.init(); {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:24,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {9844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9836#true} is VALID [2022-04-15 06:52:24,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {9836#true} assume true; {9836#true} is VALID [2022-04-15 06:52:24,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9836#true} {9836#true} #48#return; {9836#true} is VALID [2022-04-15 06:52:24,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {9836#true} call #t~ret7 := main(); {9836#true} is VALID [2022-04-15 06:52:24,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {9836#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9841#(= main_~x~0 0)} is VALID [2022-04-15 06:52:24,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {9841#(= main_~x~0 0)} [156] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_128| |v_main_#t~post4_127|)) (.cse1 (= v_main_~x~0_609 v_main_~x~0_608))) (or (and .cse0 .cse1 (not (< v_main_~x~0_609 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_608 500001) (< v_main_~x~0_609 v_main_~x~0_608)))) InVars {main_~x~0=v_main_~x~0_609, main_#t~post4=|v_main_#t~post4_128|} OutVars{main_~x~0=v_main_~x~0_608, main_#t~post4=|v_main_#t~post4_127|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9842#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:24,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#(<= main_~x~0 500000)} [157] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9842#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:24,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {9842#(<= main_~x~0 500000)} [158] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_611)) (.cse1 (= v_main_~x~0_611 v_main_~x~0_610))) (or (and (< v_main_~y~0_422 (+ v_main_~y~0_423 2 (div (+ (* v_main_~x~0_611 (- 1)) 999999) 2))) (= (+ v_main_~x~0_610 (* v_main_~y~0_423 2)) (+ v_main_~x~0_611 (* v_main_~y~0_422 2))) .cse0 (< v_main_~y~0_423 v_main_~y~0_422)) (and (or (not (< v_main_~x~0_611 1000000)) (not .cse0)) .cse1 (= v_main_~y~0_422 v_main_~y~0_423) (= |v_main_#t~post6_218| |v_main_#t~post6_220|)) (and (= |v_main_#t~post6_220| |v_main_#t~post6_218|) (= v_main_~y~0_423 v_main_~y~0_422) .cse1))) InVars {main_~y~0=v_main_~y~0_423, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_422, main_~x~0=v_main_~x~0_610, main_#t~post6=|v_main_#t~post6_218|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {9843#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:24,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {9843#(<= main_~x~0 999999)} [159] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9843#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:24,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {9843#(<= main_~x~0 999999)} [160] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_107| |v_main_#t~post5_106|)) (.cse2 (= v_main_~x~0_613 v_main_~x~0_612)) (.cse3 (= v_main_~y~0_425 v_main_~y~0_424)) (.cse0 (<= 500000 v_main_~x~0_613))) (or (and (< v_main_~x~0_612 750001) (< v_main_~x~0_613 v_main_~x~0_612) .cse0 (= (+ v_main_~x~0_613 v_main_~y~0_424) (+ v_main_~x~0_612 v_main_~y~0_425))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_223| |v_main_#t~post6_219|)) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_613 750000)) (not .cse0)) (= |v_main_#t~post6_219| |v_main_#t~post6_223|)))) InVars {main_~y~0=v_main_~y~0_425, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_613, main_#t~post6=|v_main_#t~post6_223|} OutVars{main_~y~0=v_main_~y~0_424, main_#t~post5=|v_main_#t~post5_106|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9843#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:24,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {9843#(<= main_~x~0 999999)} [155] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {9837#false} is VALID [2022-04-15 06:52:24,199 INFO L272 TraceCheckUtils]: 12: Hoare triple {9837#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {9837#false} is VALID [2022-04-15 06:52:24,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {9837#false} ~cond := #in~cond; {9837#false} is VALID [2022-04-15 06:52:24,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {9837#false} assume 0 == ~cond; {9837#false} is VALID [2022-04-15 06:52:24,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {9837#false} assume !false; {9837#false} is VALID [2022-04-15 06:52:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:52:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:24,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847590360] [2022-04-15 06:52:24,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847590360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:24,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336137240] [2022-04-15 06:52:24,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:24,204 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:24,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 06:52:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:24,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:52:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:24,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:24,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {9836#true} call ULTIMATE.init(); {9836#true} is VALID [2022-04-15 06:52:24,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {9836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9836#true} is VALID [2022-04-15 06:52:24,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {9836#true} assume true; {9836#true} is VALID [2022-04-15 06:52:24,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9836#true} {9836#true} #48#return; {9836#true} is VALID [2022-04-15 06:52:24,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {9836#true} call #t~ret7 := main(); {9836#true} is VALID [2022-04-15 06:52:24,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {9836#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9841#(= main_~x~0 0)} is VALID [2022-04-15 06:52:24,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {9841#(= main_~x~0 0)} [156] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_128| |v_main_#t~post4_127|)) (.cse1 (= v_main_~x~0_609 v_main_~x~0_608))) (or (and .cse0 .cse1 (not (< v_main_~x~0_609 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_608 500001) (< v_main_~x~0_609 v_main_~x~0_608)))) InVars {main_~x~0=v_main_~x~0_609, main_#t~post4=|v_main_#t~post4_128|} OutVars{main_~x~0=v_main_~x~0_608, main_#t~post4=|v_main_#t~post4_127|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:52:24,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [157] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:52:24,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [158] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_611)) (.cse1 (= v_main_~x~0_611 v_main_~x~0_610))) (or (and (< v_main_~y~0_422 (+ v_main_~y~0_423 2 (div (+ (* v_main_~x~0_611 (- 1)) 999999) 2))) (= (+ v_main_~x~0_610 (* v_main_~y~0_423 2)) (+ v_main_~x~0_611 (* v_main_~y~0_422 2))) .cse0 (< v_main_~y~0_423 v_main_~y~0_422)) (and (or (not (< v_main_~x~0_611 1000000)) (not .cse0)) .cse1 (= v_main_~y~0_422 v_main_~y~0_423) (= |v_main_#t~post6_218| |v_main_#t~post6_220|)) (and (= |v_main_#t~post6_220| |v_main_#t~post6_218|) (= v_main_~y~0_423 v_main_~y~0_422) .cse1))) InVars {main_~y~0=v_main_~y~0_423, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_422, main_~x~0=v_main_~x~0_610, main_#t~post6=|v_main_#t~post6_218|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:52:24,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [159] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:52:24,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {9866#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [160] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_107| |v_main_#t~post5_106|)) (.cse2 (= v_main_~x~0_613 v_main_~x~0_612)) (.cse3 (= v_main_~y~0_425 v_main_~y~0_424)) (.cse0 (<= 500000 v_main_~x~0_613))) (or (and (< v_main_~x~0_612 750001) (< v_main_~x~0_613 v_main_~x~0_612) .cse0 (= (+ v_main_~x~0_613 v_main_~y~0_424) (+ v_main_~x~0_612 v_main_~y~0_425))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_223| |v_main_#t~post6_219|)) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_613 750000)) (not .cse0)) (= |v_main_#t~post6_219| |v_main_#t~post6_223|)))) InVars {main_~y~0=v_main_~y~0_425, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_613, main_#t~post6=|v_main_#t~post6_223|} OutVars{main_~y~0=v_main_~y~0_424, main_#t~post5=|v_main_#t~post5_106|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9879#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:52:24,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {9879#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [155] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {9837#false} is VALID [2022-04-15 06:52:24,452 INFO L272 TraceCheckUtils]: 12: Hoare triple {9837#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {9837#false} is VALID [2022-04-15 06:52:24,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {9837#false} ~cond := #in~cond; {9837#false} is VALID [2022-04-15 06:52:24,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {9837#false} assume 0 == ~cond; {9837#false} is VALID [2022-04-15 06:52:24,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {9837#false} assume !false; {9837#false} is VALID [2022-04-15 06:52:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:24,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:25,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {9837#false} assume !false; {9837#false} is VALID [2022-04-15 06:52:25,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {9898#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9837#false} is VALID [2022-04-15 06:52:25,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {9902#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9898#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:52:25,071 INFO L272 TraceCheckUtils]: 12: Hoare triple {9906#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {9902#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:52:25,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {9910#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [155] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {9906#(= main_~x~0 1000000)} is VALID [2022-04-15 06:52:25,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {9910#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [160] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_107| |v_main_#t~post5_106|)) (.cse2 (= v_main_~x~0_613 v_main_~x~0_612)) (.cse3 (= v_main_~y~0_425 v_main_~y~0_424)) (.cse0 (<= 500000 v_main_~x~0_613))) (or (and (< v_main_~x~0_612 750001) (< v_main_~x~0_613 v_main_~x~0_612) .cse0 (= (+ v_main_~x~0_613 v_main_~y~0_424) (+ v_main_~x~0_612 v_main_~y~0_425))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_223| |v_main_#t~post6_219|)) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_613 750000)) (not .cse0)) (= |v_main_#t~post6_219| |v_main_#t~post6_223|)))) InVars {main_~y~0=v_main_~y~0_425, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_613, main_#t~post6=|v_main_#t~post6_223|} OutVars{main_~y~0=v_main_~y~0_424, main_#t~post5=|v_main_#t~post5_106|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9910#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:25,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {9910#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [159] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9910#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:25,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {9920#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [158] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_611)) (.cse1 (= v_main_~x~0_611 v_main_~x~0_610))) (or (and (< v_main_~y~0_422 (+ v_main_~y~0_423 2 (div (+ (* v_main_~x~0_611 (- 1)) 999999) 2))) (= (+ v_main_~x~0_610 (* v_main_~y~0_423 2)) (+ v_main_~x~0_611 (* v_main_~y~0_422 2))) .cse0 (< v_main_~y~0_423 v_main_~y~0_422)) (and (or (not (< v_main_~x~0_611 1000000)) (not .cse0)) .cse1 (= v_main_~y~0_422 v_main_~y~0_423) (= |v_main_#t~post6_218| |v_main_#t~post6_220|)) (and (= |v_main_#t~post6_220| |v_main_#t~post6_218|) (= v_main_~y~0_423 v_main_~y~0_422) .cse1))) InVars {main_~y~0=v_main_~y~0_423, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_422, main_~x~0=v_main_~x~0_610, main_#t~post6=|v_main_#t~post6_218|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {9910#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:25,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {9920#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [157] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9920#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:25,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {9920#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [156] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_128| |v_main_#t~post4_127|)) (.cse1 (= v_main_~x~0_609 v_main_~x~0_608))) (or (and .cse0 .cse1 (not (< v_main_~x~0_609 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_608 500001) (< v_main_~x~0_609 v_main_~x~0_608)))) InVars {main_~x~0=v_main_~x~0_609, main_#t~post4=|v_main_#t~post4_128|} OutVars{main_~x~0=v_main_~x~0_608, main_#t~post4=|v_main_#t~post4_127|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9920#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:25,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {9836#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9920#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:25,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {9836#true} call #t~ret7 := main(); {9836#true} is VALID [2022-04-15 06:52:25,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9836#true} {9836#true} #48#return; {9836#true} is VALID [2022-04-15 06:52:25,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {9836#true} assume true; {9836#true} is VALID [2022-04-15 06:52:25,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {9836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {9836#true} is VALID [2022-04-15 06:52:25,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {9836#true} call ULTIMATE.init(); {9836#true} is VALID [2022-04-15 06:52:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:25,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336137240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:25,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:25,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:52:25,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:25,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1522668544] [2022-04-15 06:52:25,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1522668544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:25,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:25,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:52:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667236228] [2022-04-15 06:52:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 06:52:25,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:25,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:25,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:25,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:52:25,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:25,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:52:25,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:52:25,806 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,022 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-04-15 06:52:29,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:52:29,022 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 06:52:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2022-04-15 06:52:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 108 transitions. [2022-04-15 06:52:29,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 108 transitions. [2022-04-15 06:52:29,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:29,109 INFO L225 Difference]: With dead ends: 119 [2022-04-15 06:52:29,109 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 06:52:29,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=346, Invalid=2516, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:52:29,110 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 69 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:29,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 132 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:52:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 06:52:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2022-04-15 06:52:29,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:29,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 06:52:29,794 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 06:52:29,795 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 06:52:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,796 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-15 06:52:29,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 06:52:29,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:29,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:29,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 101 states. [2022-04-15 06:52:29,797 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 101 states. [2022-04-15 06:52:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:29,798 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-15 06:52:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 06:52:29,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:29,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:29,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:29,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 06:52:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-04-15 06:52:29,800 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 89 [2022-04-15 06:52:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:29,801 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-04-15 06:52:29,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 23 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:29,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2022-04-15 06:52:29,988 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 06:52:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 06:52:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 06:52:29,989 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:29,989 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:30,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:30,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:30,190 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash -863760491, now seen corresponding path program 18 times [2022-04-15 06:52:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:30,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649596526] [2022-04-15 06:52:34,257 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:34,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:34,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:34,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:34,787 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 511621927, now seen corresponding path program 1 times [2022-04-15 06:52:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:34,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986886563] [2022-04-15 06:52:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:34,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {10649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10641#true} is VALID [2022-04-15 06:52:34,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {10641#true} assume true; {10641#true} is VALID [2022-04-15 06:52:34,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10641#true} {10641#true} #48#return; {10641#true} is VALID [2022-04-15 06:52:34,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {10641#true} call ULTIMATE.init(); {10649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:34,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {10649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10641#true} is VALID [2022-04-15 06:52:34,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {10641#true} assume true; {10641#true} is VALID [2022-04-15 06:52:34,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10641#true} {10641#true} #48#return; {10641#true} is VALID [2022-04-15 06:52:34,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {10641#true} call #t~ret7 := main(); {10641#true} is VALID [2022-04-15 06:52:34,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {10641#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10646#(= main_~x~0 0)} is VALID [2022-04-15 06:52:34,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {10646#(= main_~x~0 0)} [162] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_653 v_main_~x~0_652)) (.cse1 (= |v_main_#t~post4_135| |v_main_#t~post4_134|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_653)) (and .cse0 .cse1) (and (< v_main_~x~0_653 v_main_~x~0_652) (< v_main_~x~0_652 500001)))) InVars {main_~x~0=v_main_~x~0_653, main_#t~post4=|v_main_#t~post4_135|} OutVars{main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_134|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10647#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:34,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {10647#(<= main_~x~0 500000)} [163] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:34,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {10647#(<= main_~x~0 500000)} [164] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_233| |v_main_#t~post6_231|)) (.cse2 (= v_main_~x~0_655 v_main_~x~0_654)) (.cse3 (= v_main_~y~0_457 v_main_~y~0_456)) (.cse1 (<= 750000 v_main_~x~0_655))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_655 1000000))) .cse2 .cse3) (and .cse0 .cse2 .cse3) (and (< v_main_~y~0_456 (+ v_main_~y~0_457 (div (+ 999999 (* v_main_~x~0_655 (- 1))) 2) 2)) (= (+ v_main_~x~0_655 (* v_main_~y~0_456 2)) (+ v_main_~x~0_654 (* v_main_~y~0_457 2))) (< v_main_~y~0_457 v_main_~y~0_456) .cse1))) InVars {main_~y~0=v_main_~y~0_457, main_~x~0=v_main_~x~0_655, main_#t~post6=|v_main_#t~post6_233|} OutVars{main_~y~0=v_main_~y~0_456, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_231|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {10648#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:34,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {10648#(<= main_~x~0 999999)} [165] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10648#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:34,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {10648#(<= main_~x~0 999999)} [166] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_657)) (.cse2 (= |v_main_#t~post5_113| |v_main_#t~post5_112|)) (.cse3 (= |v_main_#t~post6_236| |v_main_#t~post6_232|)) (.cse4 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse5 (= v_main_~x~0_657 v_main_~x~0_656))) (or (let ((.cse0 (+ v_main_~x~0_657 v_main_~y~0_458))) (and (= .cse0 (+ v_main_~x~0_656 v_main_~y~0_459)) (< v_main_~y~0_459 v_main_~y~0_458) (< .cse0 (+ 750001 v_main_~y~0_459)) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse1) (not (< v_main_~x~0_657 750000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_236|} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post5=|v_main_#t~post5_112|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_232|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10648#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:34,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {10648#(<= main_~x~0 999999)} [161] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {10642#false} is VALID [2022-04-15 06:52:34,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {10642#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {10642#false} is VALID [2022-04-15 06:52:34,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {10642#false} ~cond := #in~cond; {10642#false} is VALID [2022-04-15 06:52:34,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {10642#false} assume 0 == ~cond; {10642#false} is VALID [2022-04-15 06:52:34,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {10642#false} assume !false; {10642#false} is VALID [2022-04-15 06:52:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:52:34,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986886563] [2022-04-15 06:52:34,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986886563] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:34,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431072567] [2022-04-15 06:52:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:34,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:34,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:34,856 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:34,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 06:52:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:34,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:52:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:34,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:35,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {10641#true} call ULTIMATE.init(); {10641#true} is VALID [2022-04-15 06:52:35,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {10641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10641#true} is VALID [2022-04-15 06:52:35,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {10641#true} assume true; {10641#true} is VALID [2022-04-15 06:52:35,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10641#true} {10641#true} #48#return; {10641#true} is VALID [2022-04-15 06:52:35,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {10641#true} call #t~ret7 := main(); {10641#true} is VALID [2022-04-15 06:52:35,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {10641#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10668#(<= main_~x~0 0)} is VALID [2022-04-15 06:52:35,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {10668#(<= main_~x~0 0)} [162] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_653 v_main_~x~0_652)) (.cse1 (= |v_main_#t~post4_135| |v_main_#t~post4_134|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_653)) (and .cse0 .cse1) (and (< v_main_~x~0_653 v_main_~x~0_652) (< v_main_~x~0_652 500001)))) InVars {main_~x~0=v_main_~x~0_653, main_#t~post4=|v_main_#t~post4_135|} OutVars{main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_134|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10647#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:35,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {10647#(<= main_~x~0 500000)} [163] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:35,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {10647#(<= main_~x~0 500000)} [164] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_233| |v_main_#t~post6_231|)) (.cse2 (= v_main_~x~0_655 v_main_~x~0_654)) (.cse3 (= v_main_~y~0_457 v_main_~y~0_456)) (.cse1 (<= 750000 v_main_~x~0_655))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_655 1000000))) .cse2 .cse3) (and .cse0 .cse2 .cse3) (and (< v_main_~y~0_456 (+ v_main_~y~0_457 (div (+ 999999 (* v_main_~x~0_655 (- 1))) 2) 2)) (= (+ v_main_~x~0_655 (* v_main_~y~0_456 2)) (+ v_main_~x~0_654 (* v_main_~y~0_457 2))) (< v_main_~y~0_457 v_main_~y~0_456) .cse1))) InVars {main_~y~0=v_main_~y~0_457, main_~x~0=v_main_~x~0_655, main_#t~post6=|v_main_#t~post6_233|} OutVars{main_~y~0=v_main_~y~0_456, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_231|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {10647#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:35,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {10647#(<= main_~x~0 500000)} [165] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:35,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {10647#(<= main_~x~0 500000)} [166] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_657)) (.cse2 (= |v_main_#t~post5_113| |v_main_#t~post5_112|)) (.cse3 (= |v_main_#t~post6_236| |v_main_#t~post6_232|)) (.cse4 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse5 (= v_main_~x~0_657 v_main_~x~0_656))) (or (let ((.cse0 (+ v_main_~x~0_657 v_main_~y~0_458))) (and (= .cse0 (+ v_main_~x~0_656 v_main_~y~0_459)) (< v_main_~y~0_459 v_main_~y~0_458) (< .cse0 (+ 750001 v_main_~y~0_459)) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse1) (not (< v_main_~x~0_657 750000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_236|} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post5=|v_main_#t~post5_112|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_232|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10684#(< main_~x~0 750001)} is VALID [2022-04-15 06:52:35,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {10684#(< main_~x~0 750001)} [161] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {10642#false} is VALID [2022-04-15 06:52:35,049 INFO L272 TraceCheckUtils]: 12: Hoare triple {10642#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {10642#false} is VALID [2022-04-15 06:52:35,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {10642#false} ~cond := #in~cond; {10642#false} is VALID [2022-04-15 06:52:35,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {10642#false} assume 0 == ~cond; {10642#false} is VALID [2022-04-15 06:52:35,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {10642#false} assume !false; {10642#false} is VALID [2022-04-15 06:52:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:35,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:47,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {10642#false} assume !false; {10642#false} is VALID [2022-04-15 06:52:47,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {10703#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10642#false} is VALID [2022-04-15 06:52:47,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {10707#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10703#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:52:47,684 INFO L272 TraceCheckUtils]: 12: Hoare triple {10711#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {10707#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:52:47,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {10715#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [161] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {10711#(= main_~x~0 1000000)} is VALID [2022-04-15 06:52:47,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {10715#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [166] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_657)) (.cse2 (= |v_main_#t~post5_113| |v_main_#t~post5_112|)) (.cse3 (= |v_main_#t~post6_236| |v_main_#t~post6_232|)) (.cse4 (= v_main_~y~0_459 v_main_~y~0_458)) (.cse5 (= v_main_~x~0_657 v_main_~x~0_656))) (or (let ((.cse0 (+ v_main_~x~0_657 v_main_~y~0_458))) (and (= .cse0 (+ v_main_~x~0_656 v_main_~y~0_459)) (< v_main_~y~0_459 v_main_~y~0_458) (< .cse0 (+ 750001 v_main_~y~0_459)) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse1) (not (< v_main_~x~0_657 750000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_459, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_236|} OutVars{main_~y~0=v_main_~y~0_458, main_#t~post5=|v_main_#t~post5_112|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_232|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10715#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:47,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {10715#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [165] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10715#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:47,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {10725#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [164] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_233| |v_main_#t~post6_231|)) (.cse2 (= v_main_~x~0_655 v_main_~x~0_654)) (.cse3 (= v_main_~y~0_457 v_main_~y~0_456)) (.cse1 (<= 750000 v_main_~x~0_655))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_655 1000000))) .cse2 .cse3) (and .cse0 .cse2 .cse3) (and (< v_main_~y~0_456 (+ v_main_~y~0_457 (div (+ 999999 (* v_main_~x~0_655 (- 1))) 2) 2)) (= (+ v_main_~x~0_655 (* v_main_~y~0_456 2)) (+ v_main_~x~0_654 (* v_main_~y~0_457 2))) (< v_main_~y~0_457 v_main_~y~0_456) .cse1))) InVars {main_~y~0=v_main_~y~0_457, main_~x~0=v_main_~x~0_655, main_#t~post6=|v_main_#t~post6_233|} OutVars{main_~y~0=v_main_~y~0_456, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_231|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {10715#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:47,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {10725#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [163] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10725#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:47,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {10725#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [162] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_653 v_main_~x~0_652)) (.cse1 (= |v_main_#t~post4_135| |v_main_#t~post4_134|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_653)) (and .cse0 .cse1) (and (< v_main_~x~0_653 v_main_~x~0_652) (< v_main_~x~0_652 500001)))) InVars {main_~x~0=v_main_~x~0_653, main_#t~post4=|v_main_#t~post4_135|} OutVars{main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_134|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10725#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:47,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {10641#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10725#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:52:47,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {10641#true} call #t~ret7 := main(); {10641#true} is VALID [2022-04-15 06:52:47,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10641#true} {10641#true} #48#return; {10641#true} is VALID [2022-04-15 06:52:47,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {10641#true} assume true; {10641#true} is VALID [2022-04-15 06:52:47,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {10641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {10641#true} is VALID [2022-04-15 06:52:47,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {10641#true} call ULTIMATE.init(); {10641#true} is VALID [2022-04-15 06:52:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:47,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431072567] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:47,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:47,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:52:48,377 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:48,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649596526] [2022-04-15 06:52:48,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649596526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:48,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:48,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 06:52:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127056475] [2022-04-15 06:52:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:48,378 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 06:52:48,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:48,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:48,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:48,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 06:52:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 06:52:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:52:48,448 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:51,976 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-04-15 06:52:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:52:51,976 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2022-04-15 06:52:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 112 transitions. [2022-04-15 06:52:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 112 transitions. [2022-04-15 06:52:51,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 112 transitions. [2022-04-15 06:52:52,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:52,092 INFO L225 Difference]: With dead ends: 123 [2022-04-15 06:52:52,092 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 06:52:52,093 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=2823, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:52:52,093 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:52,094 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 133 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 06:52:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 06:52:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2022-04-15 06:52:52,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:52,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:52,919 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:52,919 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:52,921 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-15 06:52:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-15 06:52:52,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:52,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:52,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 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 105 states. [2022-04-15 06:52:52,921 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 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 105 states. [2022-04-15 06:52:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:52,928 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-15 06:52:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-15 06:52:52,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:52,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:52,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:52,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2022-04-15 06:52:52,930 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 93 [2022-04-15 06:52:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:52,930 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2022-04-15 06:52:52,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.56) internal successors, (89), 24 states have internal predecessors, (89), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:52,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 104 transitions. [2022-04-15 06:52:53,101 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 06:52:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2022-04-15 06:52:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 06:52:53,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:53,102 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:53,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:53,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:53,316 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:53,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1934365804, now seen corresponding path program 19 times [2022-04-15 06:52:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:53,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525400712] [2022-04-15 06:52:53,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:55,037 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:55,172 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:55,380 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:55,381 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash 152046951, now seen corresponding path program 1 times [2022-04-15 06:52:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:55,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630114787] [2022-04-15 06:52:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:55,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {11482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11474#true} is VALID [2022-04-15 06:52:55,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {11474#true} assume true; {11474#true} is VALID [2022-04-15 06:52:55,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11474#true} {11474#true} #48#return; {11474#true} is VALID [2022-04-15 06:52:55,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {11474#true} call ULTIMATE.init(); {11482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:55,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {11482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11474#true} is VALID [2022-04-15 06:52:55,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {11474#true} assume true; {11474#true} is VALID [2022-04-15 06:52:55,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11474#true} {11474#true} #48#return; {11474#true} is VALID [2022-04-15 06:52:55,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {11474#true} call #t~ret7 := main(); {11474#true} is VALID [2022-04-15 06:52:55,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {11474#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11479#(= main_~x~0 0)} is VALID [2022-04-15 06:52:55,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {11479#(= main_~x~0 0)} [168] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_142| |v_main_#t~post4_141|)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_698 500000))) (and (< v_main_~x~0_697 500001) (< v_main_~x~0_698 v_main_~x~0_697)))) InVars {main_~x~0=v_main_~x~0_698, main_#t~post4=|v_main_#t~post4_142|} OutVars{main_~x~0=v_main_~x~0_697, main_#t~post4=|v_main_#t~post4_141|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11480#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:55,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {11480#(<= main_~x~0 500000)} [169] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11480#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:55,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {11480#(<= main_~x~0 500000)} [170] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_700)) (.cse1 (= v_main_~y~0_492 v_main_~y~0_491)) (.cse2 (= |v_main_#t~post6_246| |v_main_#t~post6_244|)) (.cse3 (= v_main_~x~0_700 v_main_~x~0_699))) (or (and (< v_main_~y~0_491 (+ v_main_~y~0_492 2 (div (+ 999999 (* v_main_~x~0_700 (- 1))) 2))) (< v_main_~y~0_492 v_main_~y~0_491) .cse0 (= (+ (* v_main_~y~0_491 2) v_main_~x~0_700) (+ v_main_~x~0_699 (* v_main_~y~0_492 2)))) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_700 1000000))) .cse3) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_492, main_~x~0=v_main_~x~0_700, main_#t~post6=|v_main_#t~post6_246|} OutVars{main_~y~0=v_main_~y~0_491, main_~x~0=v_main_~x~0_699, main_#t~post6=|v_main_#t~post6_244|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {11481#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:55,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {11481#(<= main_~x~0 999999)} [171] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11481#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:55,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {11481#(<= main_~x~0 999999)} [172] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_494 v_main_~y~0_493)) (.cse2 (= |v_main_#t~post6_249| |v_main_#t~post6_245|)) (.cse3 (= v_main_~x~0_702 v_main_~x~0_701)) (.cse4 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse1 (<= 500000 v_main_~x~0_702))) (or (and .cse0 (or (not (< v_main_~x~0_702 750000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_702 v_main_~y~0_493))) (and .cse1 (< .cse5 (+ 750001 v_main_~y~0_494)) (< v_main_~y~0_494 v_main_~y~0_493) (= .cse5 (+ v_main_~x~0_701 v_main_~y~0_494)))))) InVars {main_~y~0=v_main_~y~0_494, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_702, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_493, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_701, main_#t~post6=|v_main_#t~post6_245|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11481#(<= main_~x~0 999999)} is VALID [2022-04-15 06:52:55,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {11481#(<= main_~x~0 999999)} [167] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {11475#false} is VALID [2022-04-15 06:52:55,437 INFO L272 TraceCheckUtils]: 12: Hoare triple {11475#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {11475#false} is VALID [2022-04-15 06:52:55,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2022-04-15 06:52:55,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {11475#false} assume 0 == ~cond; {11475#false} is VALID [2022-04-15 06:52:55,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {11475#false} assume !false; {11475#false} is VALID [2022-04-15 06:52:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:52:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:55,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630114787] [2022-04-15 06:52:55,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630114787] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:55,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778050555] [2022-04-15 06:52:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:55,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:55,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:55,444 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:55,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 06:52:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:55,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:52:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:55,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:55,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {11474#true} call ULTIMATE.init(); {11474#true} is VALID [2022-04-15 06:52:55,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {11474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11474#true} is VALID [2022-04-15 06:52:55,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {11474#true} assume true; {11474#true} is VALID [2022-04-15 06:52:55,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11474#true} {11474#true} #48#return; {11474#true} is VALID [2022-04-15 06:52:55,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {11474#true} call #t~ret7 := main(); {11474#true} is VALID [2022-04-15 06:52:55,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {11474#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11501#(<= main_~x~0 0)} is VALID [2022-04-15 06:52:55,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {11501#(<= main_~x~0 0)} [168] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_142| |v_main_#t~post4_141|)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_698 500000))) (and (< v_main_~x~0_697 500001) (< v_main_~x~0_698 v_main_~x~0_697)))) InVars {main_~x~0=v_main_~x~0_698, main_#t~post4=|v_main_#t~post4_142|} OutVars{main_~x~0=v_main_~x~0_697, main_#t~post4=|v_main_#t~post4_141|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11480#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:55,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {11480#(<= main_~x~0 500000)} [169] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11480#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:55,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {11480#(<= main_~x~0 500000)} [170] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_700)) (.cse1 (= v_main_~y~0_492 v_main_~y~0_491)) (.cse2 (= |v_main_#t~post6_246| |v_main_#t~post6_244|)) (.cse3 (= v_main_~x~0_700 v_main_~x~0_699))) (or (and (< v_main_~y~0_491 (+ v_main_~y~0_492 2 (div (+ 999999 (* v_main_~x~0_700 (- 1))) 2))) (< v_main_~y~0_492 v_main_~y~0_491) .cse0 (= (+ (* v_main_~y~0_491 2) v_main_~x~0_700) (+ v_main_~x~0_699 (* v_main_~y~0_492 2)))) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_700 1000000))) .cse3) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_492, main_~x~0=v_main_~x~0_700, main_#t~post6=|v_main_#t~post6_246|} OutVars{main_~y~0=v_main_~y~0_491, main_~x~0=v_main_~x~0_699, main_#t~post6=|v_main_#t~post6_244|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {11480#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:55,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {11480#(<= main_~x~0 500000)} [171] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11480#(<= main_~x~0 500000)} is VALID [2022-04-15 06:52:55,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {11480#(<= main_~x~0 500000)} [172] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_494 v_main_~y~0_493)) (.cse2 (= |v_main_#t~post6_249| |v_main_#t~post6_245|)) (.cse3 (= v_main_~x~0_702 v_main_~x~0_701)) (.cse4 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse1 (<= 500000 v_main_~x~0_702))) (or (and .cse0 (or (not (< v_main_~x~0_702 750000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_702 v_main_~y~0_493))) (and .cse1 (< .cse5 (+ 750001 v_main_~y~0_494)) (< v_main_~y~0_494 v_main_~y~0_493) (= .cse5 (+ v_main_~x~0_701 v_main_~y~0_494)))))) InVars {main_~y~0=v_main_~y~0_494, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_702, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_493, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_701, main_#t~post6=|v_main_#t~post6_245|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11517#(< main_~x~0 750001)} is VALID [2022-04-15 06:52:55,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {11517#(< main_~x~0 750001)} [167] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {11475#false} is VALID [2022-04-15 06:52:55,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {11475#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {11475#false} is VALID [2022-04-15 06:52:55,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {11475#false} ~cond := #in~cond; {11475#false} is VALID [2022-04-15 06:52:55,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {11475#false} assume 0 == ~cond; {11475#false} is VALID [2022-04-15 06:52:55,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {11475#false} assume !false; {11475#false} is VALID [2022-04-15 06:52:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:55,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:56,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {11475#false} assume !false; {11475#false} is VALID [2022-04-15 06:52:56,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {11536#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11475#false} is VALID [2022-04-15 06:52:56,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {11540#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11536#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:52:56,016 INFO L272 TraceCheckUtils]: 12: Hoare triple {11544#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {11540#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:52:56,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {11548#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [167] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {11544#(= main_~x~0 1000000)} is VALID [2022-04-15 06:52:56,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {11548#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [172] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_494 v_main_~y~0_493)) (.cse2 (= |v_main_#t~post6_249| |v_main_#t~post6_245|)) (.cse3 (= v_main_~x~0_702 v_main_~x~0_701)) (.cse4 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse1 (<= 500000 v_main_~x~0_702))) (or (and .cse0 (or (not (< v_main_~x~0_702 750000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_702 v_main_~y~0_493))) (and .cse1 (< .cse5 (+ 750001 v_main_~y~0_494)) (< v_main_~y~0_494 v_main_~y~0_493) (= .cse5 (+ v_main_~x~0_701 v_main_~y~0_494)))))) InVars {main_~y~0=v_main_~y~0_494, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_702, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_493, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_701, main_#t~post6=|v_main_#t~post6_245|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11548#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:56,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {11548#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [171] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11548#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:56,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {11558#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [170] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_700)) (.cse1 (= v_main_~y~0_492 v_main_~y~0_491)) (.cse2 (= |v_main_#t~post6_246| |v_main_#t~post6_244|)) (.cse3 (= v_main_~x~0_700 v_main_~x~0_699))) (or (and (< v_main_~y~0_491 (+ v_main_~y~0_492 2 (div (+ 999999 (* v_main_~x~0_700 (- 1))) 2))) (< v_main_~y~0_492 v_main_~y~0_491) .cse0 (= (+ (* v_main_~y~0_491 2) v_main_~x~0_700) (+ v_main_~x~0_699 (* v_main_~y~0_492 2)))) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_700 1000000))) .cse3) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_492, main_~x~0=v_main_~x~0_700, main_#t~post6=|v_main_#t~post6_246|} OutVars{main_~y~0=v_main_~y~0_491, main_~x~0=v_main_~x~0_699, main_#t~post6=|v_main_#t~post6_244|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {11548#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:52:56,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {11558#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [169] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11558#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:52:56,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {11558#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [168] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_142| |v_main_#t~post4_141|)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_698 500000))) (and (< v_main_~x~0_697 500001) (< v_main_~x~0_698 v_main_~x~0_697)))) InVars {main_~x~0=v_main_~x~0_698, main_#t~post4=|v_main_#t~post4_142|} OutVars{main_~x~0=v_main_~x~0_697, main_#t~post4=|v_main_#t~post4_141|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11558#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:52:56,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {11474#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11558#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:52:56,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {11474#true} call #t~ret7 := main(); {11474#true} is VALID [2022-04-15 06:52:56,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11474#true} {11474#true} #48#return; {11474#true} is VALID [2022-04-15 06:52:56,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {11474#true} assume true; {11474#true} is VALID [2022-04-15 06:52:56,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {11474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {11474#true} is VALID [2022-04-15 06:52:56,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {11474#true} call ULTIMATE.init(); {11474#true} is VALID [2022-04-15 06:52:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:56,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778050555] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:56,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:56,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:52:56,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:56,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525400712] [2022-04-15 06:52:56,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525400712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:56,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:56,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:52:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185134654] [2022-04-15 06:52:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 06:52:56,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:56,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:52:56,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:56,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:52:56,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:56,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:52:56,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1070, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:52:56,804 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:00,511 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-04-15 06:53:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:53:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2022-04-15 06:53:00,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 116 transitions. [2022-04-15 06:53:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 116 transitions. [2022-04-15 06:53:00,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 116 transitions. [2022-04-15 06:53:00,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:00,608 INFO L225 Difference]: With dead ends: 127 [2022-04-15 06:53:00,608 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 06:53:00,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=383, Invalid=3039, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:53:00,610 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:00,610 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:53:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 06:53:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2022-04-15 06:53:01,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:01,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:01,416 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:01,416 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:01,417 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-15 06:53:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-15 06:53:01,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:01,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:01,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 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 109 states. [2022-04-15 06:53:01,418 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 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 109 states. [2022-04-15 06:53:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:01,419 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-15 06:53:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-15 06:53:01,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:01,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:01,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:01,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-04-15 06:53:01,421 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 97 [2022-04-15 06:53:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:01,422 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-04-15 06:53:01,422 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 25 states have internal predecessors, (93), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:01,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 108 transitions. [2022-04-15 06:53:01,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-04-15 06:53:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 06:53:01,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:01,639 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:01,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:01,839 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,SelfDestructingSolverStorable21 [2022-04-15 06:53:01,840 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1169697341, now seen corresponding path program 20 times [2022-04-15 06:53:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:01,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [861040472] [2022-04-15 06:53:05,905 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:05,952 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:08,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:08,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:08,419 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:08,422 INFO L85 PathProgramCache]: Analyzing trace with hash -207528025, now seen corresponding path program 1 times [2022-04-15 06:53:08,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:08,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58200858] [2022-04-15 06:53:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:08,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {12342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12334#true} is VALID [2022-04-15 06:53:08,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {12334#true} assume true; {12334#true} is VALID [2022-04-15 06:53:08,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12334#true} {12334#true} #48#return; {12334#true} is VALID [2022-04-15 06:53:08,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {12334#true} call ULTIMATE.init(); {12342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:08,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {12342#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12334#true} is VALID [2022-04-15 06:53:08,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {12334#true} assume true; {12334#true} is VALID [2022-04-15 06:53:08,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12334#true} {12334#true} #48#return; {12334#true} is VALID [2022-04-15 06:53:08,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {12334#true} call #t~ret7 := main(); {12334#true} is VALID [2022-04-15 06:53:08,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {12334#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12339#(= main_~x~0 0)} is VALID [2022-04-15 06:53:08,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {12339#(= main_~x~0 0)} [174] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_149| |v_main_#t~post4_148|)) (.cse1 (= v_main_~x~0_744 v_main_~x~0_743))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_744 500000)) .cse0 .cse1) (and (< v_main_~x~0_743 500001) (< v_main_~x~0_744 v_main_~x~0_743)))) InVars {main_~x~0=v_main_~x~0_744, main_#t~post4=|v_main_#t~post4_149|} OutVars{main_~x~0=v_main_~x~0_743, main_#t~post4=|v_main_#t~post4_148|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {12340#(<= main_~x~0 500000)} [175] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {12340#(<= main_~x~0 500000)} [176] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_746)) (.cse1 (= v_main_~x~0_746 v_main_~x~0_745)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse3 (= |v_main_#t~post6_259| |v_main_#t~post6_257|))) (or (and (< v_main_~y~0_528 v_main_~y~0_527) (< v_main_~y~0_527 (+ v_main_~y~0_528 (div (+ 999999 (* v_main_~x~0_746 (- 1))) 2) 2)) .cse0 (= (+ v_main_~x~0_746 (* v_main_~y~0_527 2)) (+ v_main_~x~0_745 (* v_main_~y~0_528 2)))) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_746 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_~x~0=v_main_~x~0_746, main_#t~post6=|v_main_#t~post6_259|} OutVars{main_~y~0=v_main_~y~0_527, main_~x~0=v_main_~x~0_745, main_#t~post6=|v_main_#t~post6_257|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {12340#(<= main_~x~0 500000)} [177] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {12340#(<= main_~x~0 500000)} [178] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_748)) (.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and (= v_main_~y~0_530 v_main_~y~0_529) (= |v_main_#t~post6_262| |v_main_#t~post6_258|) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_748 v_main_~y~0_529))) (and .cse2 (< .cse3 (+ 750001 v_main_~y~0_530)) (< v_main_~y~0_530 v_main_~y~0_529) (= (+ v_main_~x~0_747 v_main_~y~0_530) .cse3))) (and (= |v_main_#t~post6_258| |v_main_#t~post6_262|) (or (not (< v_main_~x~0_748 750000)) (not .cse2)) (= v_main_~y~0_529 v_main_~y~0_530) .cse0 .cse1))) InVars {main_~y~0=v_main_~y~0_530, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_748, main_#t~post6=|v_main_#t~post6_262|} OutVars{main_~y~0=v_main_~y~0_529, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_747, main_#t~post6=|v_main_#t~post6_258|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12341#(<= main_~x~0 750000)} is VALID [2022-04-15 06:53:08,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {12341#(<= main_~x~0 750000)} [173] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {12335#false} is VALID [2022-04-15 06:53:08,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {12335#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {12335#false} is VALID [2022-04-15 06:53:08,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {12335#false} ~cond := #in~cond; {12335#false} is VALID [2022-04-15 06:53:08,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {12335#false} assume 0 == ~cond; {12335#false} is VALID [2022-04-15 06:53:08,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {12335#false} assume !false; {12335#false} is VALID [2022-04-15 06:53:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:08,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58200858] [2022-04-15 06:53:08,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58200858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:08,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636119679] [2022-04-15 06:53:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:08,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:08,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:08,492 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:08,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 06:53:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:53:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:08,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {12334#true} call ULTIMATE.init(); {12334#true} is VALID [2022-04-15 06:53:08,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {12334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12334#true} is VALID [2022-04-15 06:53:08,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {12334#true} assume true; {12334#true} is VALID [2022-04-15 06:53:08,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12334#true} {12334#true} #48#return; {12334#true} is VALID [2022-04-15 06:53:08,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {12334#true} call #t~ret7 := main(); {12334#true} is VALID [2022-04-15 06:53:08,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {12334#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12361#(<= main_~x~0 0)} is VALID [2022-04-15 06:53:08,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {12361#(<= main_~x~0 0)} [174] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_149| |v_main_#t~post4_148|)) (.cse1 (= v_main_~x~0_744 v_main_~x~0_743))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_744 500000)) .cse0 .cse1) (and (< v_main_~x~0_743 500001) (< v_main_~x~0_744 v_main_~x~0_743)))) InVars {main_~x~0=v_main_~x~0_744, main_#t~post4=|v_main_#t~post4_149|} OutVars{main_~x~0=v_main_~x~0_743, main_#t~post4=|v_main_#t~post4_148|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {12340#(<= main_~x~0 500000)} [175] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {12340#(<= main_~x~0 500000)} [176] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_746)) (.cse1 (= v_main_~x~0_746 v_main_~x~0_745)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse3 (= |v_main_#t~post6_259| |v_main_#t~post6_257|))) (or (and (< v_main_~y~0_528 v_main_~y~0_527) (< v_main_~y~0_527 (+ v_main_~y~0_528 (div (+ 999999 (* v_main_~x~0_746 (- 1))) 2) 2)) .cse0 (= (+ v_main_~x~0_746 (* v_main_~y~0_527 2)) (+ v_main_~x~0_745 (* v_main_~y~0_528 2)))) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_746 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_~x~0=v_main_~x~0_746, main_#t~post6=|v_main_#t~post6_259|} OutVars{main_~y~0=v_main_~y~0_527, main_~x~0=v_main_~x~0_745, main_#t~post6=|v_main_#t~post6_257|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {12340#(<= main_~x~0 500000)} [177] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12340#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:08,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {12340#(<= main_~x~0 500000)} [178] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_748)) (.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and (= v_main_~y~0_530 v_main_~y~0_529) (= |v_main_#t~post6_262| |v_main_#t~post6_258|) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_748 v_main_~y~0_529))) (and .cse2 (< .cse3 (+ 750001 v_main_~y~0_530)) (< v_main_~y~0_530 v_main_~y~0_529) (= (+ v_main_~x~0_747 v_main_~y~0_530) .cse3))) (and (= |v_main_#t~post6_258| |v_main_#t~post6_262|) (or (not (< v_main_~x~0_748 750000)) (not .cse2)) (= v_main_~y~0_529 v_main_~y~0_530) .cse0 .cse1))) InVars {main_~y~0=v_main_~y~0_530, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_748, main_#t~post6=|v_main_#t~post6_262|} OutVars{main_~y~0=v_main_~y~0_529, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_747, main_#t~post6=|v_main_#t~post6_258|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12341#(<= main_~x~0 750000)} is VALID [2022-04-15 06:53:08,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {12341#(<= main_~x~0 750000)} [173] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {12335#false} is VALID [2022-04-15 06:53:08,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {12335#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {12335#false} is VALID [2022-04-15 06:53:08,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {12335#false} ~cond := #in~cond; {12335#false} is VALID [2022-04-15 06:53:08,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {12335#false} assume 0 == ~cond; {12335#false} is VALID [2022-04-15 06:53:08,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {12335#false} assume !false; {12335#false} is VALID [2022-04-15 06:53:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:08,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:21,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {12335#false} assume !false; {12335#false} is VALID [2022-04-15 06:53:21,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {12395#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12335#false} is VALID [2022-04-15 06:53:21,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {12399#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12395#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:53:21,430 INFO L272 TraceCheckUtils]: 12: Hoare triple {12403#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {12399#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:53:21,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {12407#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [173] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {12403#(= main_~x~0 1000000)} is VALID [2022-04-15 06:53:21,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {12407#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [178] L11-2-->L10-2_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_748)) (.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~x~0_748 v_main_~x~0_747))) (or (and (= v_main_~y~0_530 v_main_~y~0_529) (= |v_main_#t~post6_262| |v_main_#t~post6_258|) .cse0 .cse1) (let ((.cse3 (+ v_main_~x~0_748 v_main_~y~0_529))) (and .cse2 (< .cse3 (+ 750001 v_main_~y~0_530)) (< v_main_~y~0_530 v_main_~y~0_529) (= (+ v_main_~x~0_747 v_main_~y~0_530) .cse3))) (and (= |v_main_#t~post6_258| |v_main_#t~post6_262|) (or (not (< v_main_~x~0_748 750000)) (not .cse2)) (= v_main_~y~0_529 v_main_~y~0_530) .cse0 .cse1))) InVars {main_~y~0=v_main_~y~0_530, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_748, main_#t~post6=|v_main_#t~post6_262|} OutVars{main_~y~0=v_main_~y~0_529, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_747, main_#t~post6=|v_main_#t~post6_258|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12407#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:21,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [177] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12407#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:21,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {12417#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [176] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_746)) (.cse1 (= v_main_~x~0_746 v_main_~x~0_745)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse3 (= |v_main_#t~post6_259| |v_main_#t~post6_257|))) (or (and (< v_main_~y~0_528 v_main_~y~0_527) (< v_main_~y~0_527 (+ v_main_~y~0_528 (div (+ 999999 (* v_main_~x~0_746 (- 1))) 2) 2)) .cse0 (= (+ v_main_~x~0_746 (* v_main_~y~0_527 2)) (+ v_main_~x~0_745 (* v_main_~y~0_528 2)))) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_746 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_~x~0=v_main_~x~0_746, main_#t~post6=|v_main_#t~post6_259|} OutVars{main_~y~0=v_main_~y~0_527, main_~x~0=v_main_~x~0_745, main_#t~post6=|v_main_#t~post6_257|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {12407#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:21,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {12417#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [175] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12417#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:21,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {12417#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [174] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_149| |v_main_#t~post4_148|)) (.cse1 (= v_main_~x~0_744 v_main_~x~0_743))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_744 500000)) .cse0 .cse1) (and (< v_main_~x~0_743 500001) (< v_main_~x~0_744 v_main_~x~0_743)))) InVars {main_~x~0=v_main_~x~0_744, main_#t~post4=|v_main_#t~post4_149|} OutVars{main_~x~0=v_main_~x~0_743, main_#t~post4=|v_main_#t~post4_148|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12417#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:21,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {12334#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12417#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:21,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {12334#true} call #t~ret7 := main(); {12334#true} is VALID [2022-04-15 06:53:21,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12334#true} {12334#true} #48#return; {12334#true} is VALID [2022-04-15 06:53:21,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {12334#true} assume true; {12334#true} is VALID [2022-04-15 06:53:21,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {12334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {12334#true} is VALID [2022-04-15 06:53:21,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {12334#true} call ULTIMATE.init(); {12334#true} is VALID [2022-04-15 06:53:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:21,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636119679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:21,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:21,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:53:22,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:22,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [861040472] [2022-04-15 06:53:22,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [861040472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:22,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:22,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:53:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243027958] [2022-04-15 06:53:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:22,181 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 06:53:22,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:22,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:22,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:22,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:53:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:53:22,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 06:53:22,256 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:26,332 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2022-04-15 06:53:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:53:26,332 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-15 06:53:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2022-04-15 06:53:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 120 transitions. [2022-04-15 06:53:26,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 120 transitions. [2022-04-15 06:53:26,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:26,437 INFO L225 Difference]: With dead ends: 131 [2022-04-15 06:53:26,437 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 06:53:26,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=3198, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:53:26,439 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 78 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:26,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 145 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:53:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 06:53:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-15 06:53:27,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:27,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:27,357 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:27,357 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:27,358 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2022-04-15 06:53:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-04-15 06:53:27,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:27,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:27,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 06:53:27,359 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 113 states. [2022-04-15 06:53:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:27,360 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2022-04-15 06:53:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-04-15 06:53:27,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:27,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:27,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:27,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2022-04-15 06:53:27,362 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 101 [2022-04-15 06:53:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:27,363 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2022-04-15 06:53:27,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.5925925925925926) internal successors, (97), 26 states have internal predecessors, (97), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:27,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 112 transitions. [2022-04-15 06:53:27,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-15 06:53:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 06:53:27,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:27,590 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:27,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:27,790 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,SelfDestructingSolverStorable22 [2022-04-15 06:53:27,791 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1337650278, now seen corresponding path program 21 times [2022-04-15 06:53:27,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:27,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612488215] [2022-04-15 06:53:31,873 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:31,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:32,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:32,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:32,447 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash -567103001, now seen corresponding path program 1 times [2022-04-15 06:53:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:32,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893422053] [2022-04-15 06:53:32,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:32,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {13228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13220#true} is VALID [2022-04-15 06:53:32,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {13220#true} assume true; {13220#true} is VALID [2022-04-15 06:53:32,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13220#true} {13220#true} #48#return; {13220#true} is VALID [2022-04-15 06:53:32,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:32,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {13228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13220#true} is VALID [2022-04-15 06:53:32,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2022-04-15 06:53:32,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #48#return; {13220#true} is VALID [2022-04-15 06:53:32,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret7 := main(); {13220#true} is VALID [2022-04-15 06:53:32,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {13220#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13225#(= main_~x~0 0)} is VALID [2022-04-15 06:53:32,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {13225#(= main_~x~0 0)} [180] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_156| |v_main_#t~post4_155|)) (.cse1 (= v_main_~x~0_791 v_main_~x~0_790))) (or (and (< v_main_~x~0_790 500001) (< v_main_~x~0_791 v_main_~x~0_790)) (and .cse0 (<= 500000 v_main_~x~0_791) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_791, main_#t~post4=|v_main_#t~post4_156|} OutVars{main_~x~0=v_main_~x~0_790, main_#t~post4=|v_main_#t~post4_155|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13226#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:32,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {13226#(<= main_~x~0 500000)} [181] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13226#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:32,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {13226#(<= main_~x~0 500000)} [182] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_565 v_main_~y~0_564)) (.cse2 (= v_main_~x~0_793 v_main_~x~0_792)) (.cse0 (<= 750000 v_main_~x~0_793)) (.cse3 (= |v_main_#t~post6_272| |v_main_#t~post6_270|))) (or (and (< v_main_~y~0_565 v_main_~y~0_564) (< v_main_~y~0_564 (+ (div (+ 999999 (* v_main_~x~0_793 (- 1))) 2) v_main_~y~0_565 2)) (= (+ v_main_~x~0_793 (* v_main_~y~0_564 2)) (+ (* v_main_~y~0_565 2) v_main_~x~0_792)) .cse0) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_793 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_565, main_~x~0=v_main_~x~0_793, main_#t~post6=|v_main_#t~post6_272|} OutVars{main_~y~0=v_main_~y~0_564, main_~x~0=v_main_~x~0_792, main_#t~post6=|v_main_#t~post6_270|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {13226#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:32,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {13226#(<= main_~x~0 500000)} [183] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13226#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:32,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {13226#(<= main_~x~0 500000)} [184] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_275| |v_main_#t~post6_271|)) (.cse1 (= v_main_~x~0_795 v_main_~x~0_794)) (.cse2 (= v_main_~y~0_567 v_main_~y~0_566)) (.cse5 (<= 500000 v_main_~x~0_795)) (.cse3 (= |v_main_#t~post5_131| |v_main_#t~post5_130|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_795 v_main_~y~0_566))) (and (= .cse4 (+ v_main_~x~0_794 v_main_~y~0_567)) (< v_main_~y~0_567 v_main_~y~0_566) (< .cse4 (+ 750001 v_main_~y~0_567)) .cse5)) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_795 750000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_567, main_#t~post5=|v_main_#t~post5_131|, main_~x~0=v_main_~x~0_795, main_#t~post6=|v_main_#t~post6_275|} OutVars{main_~y~0=v_main_~y~0_566, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_794, main_#t~post6=|v_main_#t~post6_271|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13227#(<= main_~x~0 750000)} is VALID [2022-04-15 06:53:32,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {13227#(<= main_~x~0 750000)} [179] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {13221#false} is VALID [2022-04-15 06:53:32,501 INFO L272 TraceCheckUtils]: 12: Hoare triple {13221#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {13221#false} is VALID [2022-04-15 06:53:32,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2022-04-15 06:53:32,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2022-04-15 06:53:32,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2022-04-15 06:53:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893422053] [2022-04-15 06:53:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893422053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:32,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204488484] [2022-04-15 06:53:32,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:32,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:32,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:32,503 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:32,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 06:53:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:32,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:53:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:32,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:32,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2022-04-15 06:53:32,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13220#true} is VALID [2022-04-15 06:53:32,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2022-04-15 06:53:32,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #48#return; {13220#true} is VALID [2022-04-15 06:53:32,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret7 := main(); {13220#true} is VALID [2022-04-15 06:53:32,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {13220#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13225#(= main_~x~0 0)} is VALID [2022-04-15 06:53:32,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {13225#(= main_~x~0 0)} [180] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_156| |v_main_#t~post4_155|)) (.cse1 (= v_main_~x~0_791 v_main_~x~0_790))) (or (and (< v_main_~x~0_790 500001) (< v_main_~x~0_791 v_main_~x~0_790)) (and .cse0 (<= 500000 v_main_~x~0_791) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_791, main_#t~post4=|v_main_#t~post4_156|} OutVars{main_~x~0=v_main_~x~0_790, main_#t~post4=|v_main_#t~post4_155|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:32,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [181] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:32,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [182] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_565 v_main_~y~0_564)) (.cse2 (= v_main_~x~0_793 v_main_~x~0_792)) (.cse0 (<= 750000 v_main_~x~0_793)) (.cse3 (= |v_main_#t~post6_272| |v_main_#t~post6_270|))) (or (and (< v_main_~y~0_565 v_main_~y~0_564) (< v_main_~y~0_564 (+ (div (+ 999999 (* v_main_~x~0_793 (- 1))) 2) v_main_~y~0_565 2)) (= (+ v_main_~x~0_793 (* v_main_~y~0_564 2)) (+ (* v_main_~y~0_565 2) v_main_~x~0_792)) .cse0) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_793 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_565, main_~x~0=v_main_~x~0_793, main_#t~post6=|v_main_#t~post6_272|} OutVars{main_~y~0=v_main_~y~0_564, main_~x~0=v_main_~x~0_792, main_#t~post6=|v_main_#t~post6_270|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:32,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [183] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:32,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {13250#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [184] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_275| |v_main_#t~post6_271|)) (.cse1 (= v_main_~x~0_795 v_main_~x~0_794)) (.cse2 (= v_main_~y~0_567 v_main_~y~0_566)) (.cse5 (<= 500000 v_main_~x~0_795)) (.cse3 (= |v_main_#t~post5_131| |v_main_#t~post5_130|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_795 v_main_~y~0_566))) (and (= .cse4 (+ v_main_~x~0_794 v_main_~y~0_567)) (< v_main_~y~0_567 v_main_~y~0_566) (< .cse4 (+ 750001 v_main_~y~0_567)) .cse5)) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_795 750000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_567, main_#t~post5=|v_main_#t~post5_131|, main_~x~0=v_main_~x~0_795, main_#t~post6=|v_main_#t~post6_275|} OutVars{main_~y~0=v_main_~y~0_566, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_794, main_#t~post6=|v_main_#t~post6_271|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13263#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:53:32,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {13263#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [179] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {13221#false} is VALID [2022-04-15 06:53:32,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {13221#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {13221#false} is VALID [2022-04-15 06:53:32,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {13221#false} ~cond := #in~cond; {13221#false} is VALID [2022-04-15 06:53:32,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {13221#false} assume 0 == ~cond; {13221#false} is VALID [2022-04-15 06:53:32,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2022-04-15 06:53:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:32,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:45,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {13221#false} assume !false; {13221#false} is VALID [2022-04-15 06:53:45,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {13282#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13221#false} is VALID [2022-04-15 06:53:45,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {13286#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13282#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:53:45,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {13290#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {13286#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:53:45,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {13294#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [179] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {13290#(= main_~x~0 1000000)} is VALID [2022-04-15 06:53:45,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {13294#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [184] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_275| |v_main_#t~post6_271|)) (.cse1 (= v_main_~x~0_795 v_main_~x~0_794)) (.cse2 (= v_main_~y~0_567 v_main_~y~0_566)) (.cse5 (<= 500000 v_main_~x~0_795)) (.cse3 (= |v_main_#t~post5_131| |v_main_#t~post5_130|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_795 v_main_~y~0_566))) (and (= .cse4 (+ v_main_~x~0_794 v_main_~y~0_567)) (< v_main_~y~0_567 v_main_~y~0_566) (< .cse4 (+ 750001 v_main_~y~0_567)) .cse5)) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_795 750000)) (not .cse5)) .cse3))) InVars {main_~y~0=v_main_~y~0_567, main_#t~post5=|v_main_#t~post5_131|, main_~x~0=v_main_~x~0_795, main_#t~post6=|v_main_#t~post6_275|} OutVars{main_~y~0=v_main_~y~0_566, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_794, main_#t~post6=|v_main_#t~post6_271|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13294#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:45,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {13294#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [183] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13294#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:45,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {13304#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [182] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_565 v_main_~y~0_564)) (.cse2 (= v_main_~x~0_793 v_main_~x~0_792)) (.cse0 (<= 750000 v_main_~x~0_793)) (.cse3 (= |v_main_#t~post6_272| |v_main_#t~post6_270|))) (or (and (< v_main_~y~0_565 v_main_~y~0_564) (< v_main_~y~0_564 (+ (div (+ 999999 (* v_main_~x~0_793 (- 1))) 2) v_main_~y~0_565 2)) (= (+ v_main_~x~0_793 (* v_main_~y~0_564 2)) (+ (* v_main_~y~0_565 2) v_main_~x~0_792)) .cse0) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_793 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_565, main_~x~0=v_main_~x~0_793, main_#t~post6=|v_main_#t~post6_272|} OutVars{main_~y~0=v_main_~y~0_564, main_~x~0=v_main_~x~0_792, main_#t~post6=|v_main_#t~post6_270|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {13294#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:45,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {13304#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [181] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13304#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:45,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {13304#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [180] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_156| |v_main_#t~post4_155|)) (.cse1 (= v_main_~x~0_791 v_main_~x~0_790))) (or (and (< v_main_~x~0_790 500001) (< v_main_~x~0_791 v_main_~x~0_790)) (and .cse0 (<= 500000 v_main_~x~0_791) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_791, main_#t~post4=|v_main_#t~post4_156|} OutVars{main_~x~0=v_main_~x~0_790, main_#t~post4=|v_main_#t~post4_155|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13304#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:45,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {13220#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13304#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:45,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {13220#true} call #t~ret7 := main(); {13220#true} is VALID [2022-04-15 06:53:45,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13220#true} {13220#true} #48#return; {13220#true} is VALID [2022-04-15 06:53:45,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {13220#true} assume true; {13220#true} is VALID [2022-04-15 06:53:45,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {13220#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {13220#true} is VALID [2022-04-15 06:53:45,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {13220#true} call ULTIMATE.init(); {13220#true} is VALID [2022-04-15 06:53:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:45,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204488484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:45,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:45,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:53:46,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:46,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612488215] [2022-04-15 06:53:46,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612488215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:46,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:46,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:53:46,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273572640] [2022-04-15 06:53:46,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 06:53:46,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:46,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:46,319 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 06:53:46,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:53:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:46,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:53:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 06:53:46,320 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:50,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:50,893 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2022-04-15 06:53:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:53:50,893 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 06:53:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 124 transitions. [2022-04-15 06:53:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 124 transitions. [2022-04-15 06:53:50,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 124 transitions. [2022-04-15 06:53:50,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:50,995 INFO L225 Difference]: With dead ends: 135 [2022-04-15 06:53:50,995 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 06:53:50,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=3379, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:53:50,997 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 81 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:50,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 156 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:53:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 06:53:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2022-04-15 06:53:52,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:52,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:52,105 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:52,105 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:52,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:52,107 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 06:53:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 06:53:52,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:52,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:52,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 06:53:52,108 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 06:53:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:52,109 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 06:53:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 06:53:52,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:52,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:52,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:52,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 states have internal predecessors, (112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-04-15 06:53:52,123 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 105 [2022-04-15 06:53:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:52,123 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-04-15 06:53:52,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.607142857142857) internal successors, (101), 27 states have internal predecessors, (101), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:52,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 116 transitions. [2022-04-15 06:53:52,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-04-15 06:53:52,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 06:53:52,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:52,363 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:52,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:52,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:52,563 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash -953053711, now seen corresponding path program 22 times [2022-04-15 06:53:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:52,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919888936] [2022-04-15 06:53:52,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:54,787 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:54,898 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:55,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:55,152 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:55,155 INFO L85 PathProgramCache]: Analyzing trace with hash -926677977, now seen corresponding path program 1 times [2022-04-15 06:53:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:55,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811770435] [2022-04-15 06:53:55,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:55,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {14141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14133#true} is VALID [2022-04-15 06:53:55,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {14133#true} assume true; {14133#true} is VALID [2022-04-15 06:53:55,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14133#true} {14133#true} #48#return; {14133#true} is VALID [2022-04-15 06:53:55,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {14133#true} call ULTIMATE.init(); {14141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:55,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {14141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14133#true} is VALID [2022-04-15 06:53:55,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {14133#true} assume true; {14133#true} is VALID [2022-04-15 06:53:55,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14133#true} {14133#true} #48#return; {14133#true} is VALID [2022-04-15 06:53:55,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {14133#true} call #t~ret7 := main(); {14133#true} is VALID [2022-04-15 06:53:55,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {14133#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14138#(= main_~x~0 0)} is VALID [2022-04-15 06:53:55,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {14138#(= main_~x~0 0)} [186] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_839 v_main_~x~0_838)) (.cse1 (= |v_main_#t~post4_163| |v_main_#t~post4_162|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_839 500000)) .cse0 .cse1) (and (< v_main_~x~0_839 v_main_~x~0_838) (< v_main_~x~0_838 500001)))) InVars {main_~x~0=v_main_~x~0_839, main_#t~post4=|v_main_#t~post4_163|} OutVars{main_~x~0=v_main_~x~0_838, main_#t~post4=|v_main_#t~post4_162|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14139#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:55,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {14139#(<= main_~x~0 500000)} [187] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14139#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:55,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {14139#(<= main_~x~0 500000)} [188] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= |v_main_#t~post6_285| |v_main_#t~post6_283|)) (.cse3 (= v_main_~x~0_841 v_main_~x~0_840)) (.cse0 (<= 750000 v_main_~x~0_841))) (or (and (< v_main_~y~0_603 v_main_~y~0_602) (< v_main_~y~0_602 (+ (div (+ 999999 (* v_main_~x~0_841 (- 1))) 2) v_main_~y~0_603 2)) .cse0 (= (+ v_main_~x~0_840 (* v_main_~y~0_603 2)) (+ v_main_~x~0_841 (* v_main_~y~0_602 2)))) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_841 1000000)))))) InVars {main_~y~0=v_main_~y~0_603, main_~x~0=v_main_~x~0_841, main_#t~post6=|v_main_#t~post6_285|} OutVars{main_~y~0=v_main_~y~0_602, main_~x~0=v_main_~x~0_840, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {14139#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:55,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {14139#(<= main_~x~0 500000)} [189] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14139#(<= main_~x~0 500000)} is VALID [2022-04-15 06:53:55,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {14139#(<= main_~x~0 500000)} [190] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse1 (= v_main_~y~0_605 v_main_~y~0_604)) (.cse2 (= |v_main_#t~post6_288| |v_main_#t~post6_284|)) (.cse3 (= v_main_~x~0_843 v_main_~x~0_842)) (.cse4 (<= 500000 v_main_~x~0_843))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_843 750000)) (not .cse4)) .cse2 .cse3) (and (< v_main_~x~0_842 750001) .cse4 (= (+ v_main_~x~0_843 v_main_~y~0_604) (+ v_main_~x~0_842 v_main_~y~0_605)) (< v_main_~x~0_843 v_main_~x~0_842)))) InVars {main_~y~0=v_main_~y~0_605, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_843, main_#t~post6=|v_main_#t~post6_288|} OutVars{main_~y~0=v_main_~y~0_604, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_842, main_#t~post6=|v_main_#t~post6_284|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14140#(<= main_~x~0 750000)} is VALID [2022-04-15 06:53:55,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {14140#(<= main_~x~0 750000)} [185] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {14134#false} is VALID [2022-04-15 06:53:55,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {14134#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {14134#false} is VALID [2022-04-15 06:53:55,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {14134#false} ~cond := #in~cond; {14134#false} is VALID [2022-04-15 06:53:55,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {14134#false} assume 0 == ~cond; {14134#false} is VALID [2022-04-15 06:53:55,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {14134#false} assume !false; {14134#false} is VALID [2022-04-15 06:53:55,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:55,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:55,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811770435] [2022-04-15 06:53:55,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811770435] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:55,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135571737] [2022-04-15 06:53:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:55,216 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:55,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 06:53:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:55,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:53:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:55,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:55,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {14133#true} call ULTIMATE.init(); {14133#true} is VALID [2022-04-15 06:53:55,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {14133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14133#true} is VALID [2022-04-15 06:53:55,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {14133#true} assume true; {14133#true} is VALID [2022-04-15 06:53:55,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14133#true} {14133#true} #48#return; {14133#true} is VALID [2022-04-15 06:53:55,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {14133#true} call #t~ret7 := main(); {14133#true} is VALID [2022-04-15 06:53:55,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {14133#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14138#(= main_~x~0 0)} is VALID [2022-04-15 06:53:55,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {14138#(= main_~x~0 0)} [186] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_839 v_main_~x~0_838)) (.cse1 (= |v_main_#t~post4_163| |v_main_#t~post4_162|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_839 500000)) .cse0 .cse1) (and (< v_main_~x~0_839 v_main_~x~0_838) (< v_main_~x~0_838 500001)))) InVars {main_~x~0=v_main_~x~0_839, main_#t~post4=|v_main_#t~post4_163|} OutVars{main_~x~0=v_main_~x~0_838, main_#t~post4=|v_main_#t~post4_162|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:55,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [187] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:55,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [188] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= |v_main_#t~post6_285| |v_main_#t~post6_283|)) (.cse3 (= v_main_~x~0_841 v_main_~x~0_840)) (.cse0 (<= 750000 v_main_~x~0_841))) (or (and (< v_main_~y~0_603 v_main_~y~0_602) (< v_main_~y~0_602 (+ (div (+ 999999 (* v_main_~x~0_841 (- 1))) 2) v_main_~y~0_603 2)) .cse0 (= (+ v_main_~x~0_840 (* v_main_~y~0_603 2)) (+ v_main_~x~0_841 (* v_main_~y~0_602 2)))) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_841 1000000)))))) InVars {main_~y~0=v_main_~y~0_603, main_~x~0=v_main_~x~0_841, main_#t~post6=|v_main_#t~post6_285|} OutVars{main_~y~0=v_main_~y~0_602, main_~x~0=v_main_~x~0_840, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:55,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [189] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:53:55,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {14163#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [190] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse1 (= v_main_~y~0_605 v_main_~y~0_604)) (.cse2 (= |v_main_#t~post6_288| |v_main_#t~post6_284|)) (.cse3 (= v_main_~x~0_843 v_main_~x~0_842)) (.cse4 (<= 500000 v_main_~x~0_843))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_843 750000)) (not .cse4)) .cse2 .cse3) (and (< v_main_~x~0_842 750001) .cse4 (= (+ v_main_~x~0_843 v_main_~y~0_604) (+ v_main_~x~0_842 v_main_~y~0_605)) (< v_main_~x~0_843 v_main_~x~0_842)))) InVars {main_~y~0=v_main_~y~0_605, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_843, main_#t~post6=|v_main_#t~post6_288|} OutVars{main_~y~0=v_main_~y~0_604, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_842, main_#t~post6=|v_main_#t~post6_284|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14176#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:53:55,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {14176#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [185] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {14134#false} is VALID [2022-04-15 06:53:55,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {14134#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {14134#false} is VALID [2022-04-15 06:53:55,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {14134#false} ~cond := #in~cond; {14134#false} is VALID [2022-04-15 06:53:55,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {14134#false} assume 0 == ~cond; {14134#false} is VALID [2022-04-15 06:53:55,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {14134#false} assume !false; {14134#false} is VALID [2022-04-15 06:53:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:55,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:55,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {14134#false} assume !false; {14134#false} is VALID [2022-04-15 06:53:55,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {14195#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14134#false} is VALID [2022-04-15 06:53:55,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {14199#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14195#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:53:55,850 INFO L272 TraceCheckUtils]: 12: Hoare triple {14203#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {14199#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:53:55,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {14207#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [185] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {14203#(= main_~x~0 1000000)} is VALID [2022-04-15 06:53:55,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {14207#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [190] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse1 (= v_main_~y~0_605 v_main_~y~0_604)) (.cse2 (= |v_main_#t~post6_288| |v_main_#t~post6_284|)) (.cse3 (= v_main_~x~0_843 v_main_~x~0_842)) (.cse4 (<= 500000 v_main_~x~0_843))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_843 750000)) (not .cse4)) .cse2 .cse3) (and (< v_main_~x~0_842 750001) .cse4 (= (+ v_main_~x~0_843 v_main_~y~0_604) (+ v_main_~x~0_842 v_main_~y~0_605)) (< v_main_~x~0_843 v_main_~x~0_842)))) InVars {main_~y~0=v_main_~y~0_605, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_843, main_#t~post6=|v_main_#t~post6_288|} OutVars{main_~y~0=v_main_~y~0_604, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_842, main_#t~post6=|v_main_#t~post6_284|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14207#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:55,851 INFO L290 TraceCheckUtils]: 9: Hoare triple {14207#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [189] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14207#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:55,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {14217#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [188] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= |v_main_#t~post6_285| |v_main_#t~post6_283|)) (.cse3 (= v_main_~x~0_841 v_main_~x~0_840)) (.cse0 (<= 750000 v_main_~x~0_841))) (or (and (< v_main_~y~0_603 v_main_~y~0_602) (< v_main_~y~0_602 (+ (div (+ 999999 (* v_main_~x~0_841 (- 1))) 2) v_main_~y~0_603 2)) .cse0 (= (+ v_main_~x~0_840 (* v_main_~y~0_603 2)) (+ v_main_~x~0_841 (* v_main_~y~0_602 2)))) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_841 1000000)))))) InVars {main_~y~0=v_main_~y~0_603, main_~x~0=v_main_~x~0_841, main_#t~post6=|v_main_#t~post6_285|} OutVars{main_~y~0=v_main_~y~0_602, main_~x~0=v_main_~x~0_840, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {14207#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:53:55,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {14217#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [187] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14217#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:55,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {14217#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [186] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_839 v_main_~x~0_838)) (.cse1 (= |v_main_#t~post4_163| |v_main_#t~post4_162|))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_839 500000)) .cse0 .cse1) (and (< v_main_~x~0_839 v_main_~x~0_838) (< v_main_~x~0_838 500001)))) InVars {main_~x~0=v_main_~x~0_839, main_#t~post4=|v_main_#t~post4_163|} OutVars{main_~x~0=v_main_~x~0_838, main_#t~post4=|v_main_#t~post4_162|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14217#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:55,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {14133#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14217#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:53:55,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {14133#true} call #t~ret7 := main(); {14133#true} is VALID [2022-04-15 06:53:55,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14133#true} {14133#true} #48#return; {14133#true} is VALID [2022-04-15 06:53:55,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {14133#true} assume true; {14133#true} is VALID [2022-04-15 06:53:55,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {14133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {14133#true} is VALID [2022-04-15 06:53:55,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {14133#true} call ULTIMATE.init(); {14133#true} is VALID [2022-04-15 06:53:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:55,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135571737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:55,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:55,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:53:56,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:56,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919888936] [2022-04-15 06:53:56,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919888936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:56,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:56,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:53:56,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076702480] [2022-04-15 06:53:56,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 06:53:56,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:56,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:53:56,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:56,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:53:56,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:56,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:53:56,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:53:56,738 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:01,736 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-04-15 06:54:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:54:01,736 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 06:54:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 128 transitions. [2022-04-15 06:54:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 128 transitions. [2022-04-15 06:54:01,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 128 transitions. [2022-04-15 06:54:01,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:01,840 INFO L225 Difference]: With dead ends: 139 [2022-04-15 06:54:01,840 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 06:54:01,841 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=417, Invalid=3615, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:54:01,841 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 83 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:01,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 162 Invalid, 2633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 06:54:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 06:54:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2022-04-15 06:54:02,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:02,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:02,888 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:02,888 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:02,889 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-15 06:54:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-15 06:54:02,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:02,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:02,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 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 121 states. [2022-04-15 06:54:02,890 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 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 121 states. [2022-04-15 06:54:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:02,891 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-15 06:54:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-15 06:54:02,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:02,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:02,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:02,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 states have internal predecessors, (116), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-15 06:54:02,895 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 109 [2022-04-15 06:54:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:02,895 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-15 06:54:02,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.6206896551724137) internal successors, (105), 28 states have internal predecessors, (105), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:02,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-15 06:54:03,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-15 06:54:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 06:54:03,088 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:03,088 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:03,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 06:54:03,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:03,289 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:03,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1142621384, now seen corresponding path program 23 times [2022-04-15 06:54:03,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:03,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [157261791] [2022-04-15 06:54:03,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:05,067 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:05,169 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:05,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:05,412 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1286252953, now seen corresponding path program 1 times [2022-04-15 06:54:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:05,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186715544] [2022-04-15 06:54:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:05,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {15081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15073#true} is VALID [2022-04-15 06:54:05,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {15073#true} assume true; {15073#true} is VALID [2022-04-15 06:54:05,463 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15073#true} {15073#true} #48#return; {15073#true} is VALID [2022-04-15 06:54:05,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {15073#true} call ULTIMATE.init(); {15081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:05,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {15081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15073#true} is VALID [2022-04-15 06:54:05,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {15073#true} assume true; {15073#true} is VALID [2022-04-15 06:54:05,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15073#true} {15073#true} #48#return; {15073#true} is VALID [2022-04-15 06:54:05,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {15073#true} call #t~ret7 := main(); {15073#true} is VALID [2022-04-15 06:54:05,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {15073#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15078#(= main_~x~0 0)} is VALID [2022-04-15 06:54:05,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {15078#(= main_~x~0 0)} [192] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_170| |v_main_#t~post4_169|)) (.cse1 (= v_main_~x~0_888 v_main_~x~0_887))) (or (and .cse0 (not (< v_main_~x~0_888 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_887 500001) (< v_main_~x~0_888 v_main_~x~0_887)))) InVars {main_~x~0=v_main_~x~0_888, main_#t~post4=|v_main_#t~post4_170|} OutVars{main_~x~0=v_main_~x~0_887, main_#t~post4=|v_main_#t~post4_169|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15079#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:05,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {15079#(<= main_~x~0 500000)} [193] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15079#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:05,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {15079#(<= main_~x~0 500000)} [194] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_890)) (.cse1 (= v_main_~y~0_642 v_main_~y~0_641)) (.cse2 (= |v_main_#t~post6_298| |v_main_#t~post6_296|))) (or (and (< v_main_~y~0_641 (+ v_main_~y~0_642 2 (div (+ 999999 (* v_main_~x~0_890 (- 1))) 2))) .cse0 (= (+ v_main_~x~0_889 (* v_main_~y~0_642 2)) (+ v_main_~x~0_890 (* v_main_~y~0_641 2))) (< v_main_~y~0_642 v_main_~y~0_641)) (and (or (not (< v_main_~x~0_890 1000000)) (not .cse0)) .cse1 .cse2 (= v_main_~x~0_889 v_main_~x~0_890)) (and .cse1 (= v_main_~x~0_890 v_main_~x~0_889) .cse2))) InVars {main_~y~0=v_main_~y~0_642, main_~x~0=v_main_~x~0_890, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_641, main_~x~0=v_main_~x~0_889, main_#t~post6=|v_main_#t~post6_296|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {15080#(<= main_~x~0 999999)} is VALID [2022-04-15 06:54:05,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {15080#(<= main_~x~0 999999)} [195] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15080#(<= main_~x~0 999999)} is VALID [2022-04-15 06:54:05,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {15080#(<= main_~x~0 999999)} [196] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_301| |v_main_#t~post6_297|)) (.cse1 (= v_main_~y~0_644 v_main_~y~0_643)) (.cse2 (= |v_main_#t~post5_143| |v_main_#t~post5_142|)) (.cse3 (= v_main_~x~0_892 v_main_~x~0_891)) (.cse4 (<= 500000 v_main_~x~0_892))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_892 750000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_892 v_main_~y~0_643))) (and (< .cse5 (+ 750001 v_main_~y~0_644)) (= (+ v_main_~x~0_891 v_main_~y~0_644) .cse5) .cse4 (< v_main_~y~0_644 v_main_~y~0_643))))) InVars {main_~y~0=v_main_~y~0_644, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_892, main_#t~post6=|v_main_#t~post6_301|} OutVars{main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_142|, main_~x~0=v_main_~x~0_891, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15080#(<= main_~x~0 999999)} is VALID [2022-04-15 06:54:05,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {15080#(<= main_~x~0 999999)} [191] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {15074#false} is VALID [2022-04-15 06:54:05,467 INFO L272 TraceCheckUtils]: 12: Hoare triple {15074#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {15074#false} is VALID [2022-04-15 06:54:05,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {15074#false} ~cond := #in~cond; {15074#false} is VALID [2022-04-15 06:54:05,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {15074#false} assume 0 == ~cond; {15074#false} is VALID [2022-04-15 06:54:05,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {15074#false} assume !false; {15074#false} is VALID [2022-04-15 06:54:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:54:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:05,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186715544] [2022-04-15 06:54:05,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186715544] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:05,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396052766] [2022-04-15 06:54:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:05,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:05,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:05,468 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:05,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:54:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:05,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:54:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:05,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:05,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {15073#true} call ULTIMATE.init(); {15073#true} is VALID [2022-04-15 06:54:05,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {15073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15073#true} is VALID [2022-04-15 06:54:05,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {15073#true} assume true; {15073#true} is VALID [2022-04-15 06:54:05,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15073#true} {15073#true} #48#return; {15073#true} is VALID [2022-04-15 06:54:05,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {15073#true} call #t~ret7 := main(); {15073#true} is VALID [2022-04-15 06:54:05,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {15073#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15100#(<= main_~x~0 0)} is VALID [2022-04-15 06:54:05,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {15100#(<= main_~x~0 0)} [192] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_170| |v_main_#t~post4_169|)) (.cse1 (= v_main_~x~0_888 v_main_~x~0_887))) (or (and .cse0 (not (< v_main_~x~0_888 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_887 500001) (< v_main_~x~0_888 v_main_~x~0_887)))) InVars {main_~x~0=v_main_~x~0_888, main_#t~post4=|v_main_#t~post4_170|} OutVars{main_~x~0=v_main_~x~0_887, main_#t~post4=|v_main_#t~post4_169|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15079#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:05,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {15079#(<= main_~x~0 500000)} [193] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15079#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:05,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {15079#(<= main_~x~0 500000)} [194] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_890)) (.cse1 (= v_main_~y~0_642 v_main_~y~0_641)) (.cse2 (= |v_main_#t~post6_298| |v_main_#t~post6_296|))) (or (and (< v_main_~y~0_641 (+ v_main_~y~0_642 2 (div (+ 999999 (* v_main_~x~0_890 (- 1))) 2))) .cse0 (= (+ v_main_~x~0_889 (* v_main_~y~0_642 2)) (+ v_main_~x~0_890 (* v_main_~y~0_641 2))) (< v_main_~y~0_642 v_main_~y~0_641)) (and (or (not (< v_main_~x~0_890 1000000)) (not .cse0)) .cse1 .cse2 (= v_main_~x~0_889 v_main_~x~0_890)) (and .cse1 (= v_main_~x~0_890 v_main_~x~0_889) .cse2))) InVars {main_~y~0=v_main_~y~0_642, main_~x~0=v_main_~x~0_890, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_641, main_~x~0=v_main_~x~0_889, main_#t~post6=|v_main_#t~post6_296|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {15079#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:05,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {15079#(<= main_~x~0 500000)} [195] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15079#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:05,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {15079#(<= main_~x~0 500000)} [196] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_301| |v_main_#t~post6_297|)) (.cse1 (= v_main_~y~0_644 v_main_~y~0_643)) (.cse2 (= |v_main_#t~post5_143| |v_main_#t~post5_142|)) (.cse3 (= v_main_~x~0_892 v_main_~x~0_891)) (.cse4 (<= 500000 v_main_~x~0_892))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_892 750000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_892 v_main_~y~0_643))) (and (< .cse5 (+ 750001 v_main_~y~0_644)) (= (+ v_main_~x~0_891 v_main_~y~0_644) .cse5) .cse4 (< v_main_~y~0_644 v_main_~y~0_643))))) InVars {main_~y~0=v_main_~y~0_644, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_892, main_#t~post6=|v_main_#t~post6_301|} OutVars{main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_142|, main_~x~0=v_main_~x~0_891, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15116#(< main_~x~0 750001)} is VALID [2022-04-15 06:54:05,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {15116#(< main_~x~0 750001)} [191] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {15074#false} is VALID [2022-04-15 06:54:05,646 INFO L272 TraceCheckUtils]: 12: Hoare triple {15074#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {15074#false} is VALID [2022-04-15 06:54:05,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {15074#false} ~cond := #in~cond; {15074#false} is VALID [2022-04-15 06:54:05,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {15074#false} assume 0 == ~cond; {15074#false} is VALID [2022-04-15 06:54:05,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {15074#false} assume !false; {15074#false} is VALID [2022-04-15 06:54:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:05,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:06,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {15074#false} assume !false; {15074#false} is VALID [2022-04-15 06:54:06,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {15135#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15074#false} is VALID [2022-04-15 06:54:06,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {15139#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15135#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:06,291 INFO L272 TraceCheckUtils]: 12: Hoare triple {15143#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {15139#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:06,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {15147#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [191] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {15143#(= main_~x~0 1000000)} is VALID [2022-04-15 06:54:06,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {15147#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [196] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_301| |v_main_#t~post6_297|)) (.cse1 (= v_main_~y~0_644 v_main_~y~0_643)) (.cse2 (= |v_main_#t~post5_143| |v_main_#t~post5_142|)) (.cse3 (= v_main_~x~0_892 v_main_~x~0_891)) (.cse4 (<= 500000 v_main_~x~0_892))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_892 750000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_892 v_main_~y~0_643))) (and (< .cse5 (+ 750001 v_main_~y~0_644)) (= (+ v_main_~x~0_891 v_main_~y~0_644) .cse5) .cse4 (< v_main_~y~0_644 v_main_~y~0_643))))) InVars {main_~y~0=v_main_~y~0_644, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_892, main_#t~post6=|v_main_#t~post6_301|} OutVars{main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_142|, main_~x~0=v_main_~x~0_891, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15147#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:54:06,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {15147#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [195] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15147#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:54:06,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {15157#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [194] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_890)) (.cse1 (= v_main_~y~0_642 v_main_~y~0_641)) (.cse2 (= |v_main_#t~post6_298| |v_main_#t~post6_296|))) (or (and (< v_main_~y~0_641 (+ v_main_~y~0_642 2 (div (+ 999999 (* v_main_~x~0_890 (- 1))) 2))) .cse0 (= (+ v_main_~x~0_889 (* v_main_~y~0_642 2)) (+ v_main_~x~0_890 (* v_main_~y~0_641 2))) (< v_main_~y~0_642 v_main_~y~0_641)) (and (or (not (< v_main_~x~0_890 1000000)) (not .cse0)) .cse1 .cse2 (= v_main_~x~0_889 v_main_~x~0_890)) (and .cse1 (= v_main_~x~0_890 v_main_~x~0_889) .cse2))) InVars {main_~y~0=v_main_~y~0_642, main_~x~0=v_main_~x~0_890, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_641, main_~x~0=v_main_~x~0_889, main_#t~post6=|v_main_#t~post6_296|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {15147#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:54:06,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {15157#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [193] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15157#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:54:06,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {15157#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [192] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_170| |v_main_#t~post4_169|)) (.cse1 (= v_main_~x~0_888 v_main_~x~0_887))) (or (and .cse0 (not (< v_main_~x~0_888 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_887 500001) (< v_main_~x~0_888 v_main_~x~0_887)))) InVars {main_~x~0=v_main_~x~0_888, main_#t~post4=|v_main_#t~post4_170|} OutVars{main_~x~0=v_main_~x~0_887, main_#t~post4=|v_main_#t~post4_169|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15157#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:54:06,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {15073#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15157#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:54:06,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {15073#true} call #t~ret7 := main(); {15073#true} is VALID [2022-04-15 06:54:06,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15073#true} {15073#true} #48#return; {15073#true} is VALID [2022-04-15 06:54:06,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {15073#true} assume true; {15073#true} is VALID [2022-04-15 06:54:06,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {15073#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {15073#true} is VALID [2022-04-15 06:54:06,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {15073#true} call ULTIMATE.init(); {15073#true} is VALID [2022-04-15 06:54:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:06,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396052766] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:06,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:06,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:54:07,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:07,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [157261791] [2022-04-15 06:54:07,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [157261791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:07,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:07,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:54:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580616826] [2022-04-15 06:54:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:07,168 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 06:54:07,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:07,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:07,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:07,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:54:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:07,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:54:07,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:54:07,246 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:12,433 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-04-15 06:54:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:54:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 06:54:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 132 transitions. [2022-04-15 06:54:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 132 transitions. [2022-04-15 06:54:12,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 132 transitions. [2022-04-15 06:54:12,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:12,576 INFO L225 Difference]: With dead ends: 143 [2022-04-15 06:54:12,576 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 06:54:12,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=439, Invalid=3983, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:54:12,577 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 87 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:12,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 163 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 06:54:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 06:54:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2022-04-15 06:54:13,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:13,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:13,708 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:13,708 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:13,709 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-04-15 06:54:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-04-15 06:54:13,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:13,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:13,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 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 125 states. [2022-04-15 06:54:13,710 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 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 125 states. [2022-04-15 06:54:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:13,712 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2022-04-15 06:54:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2022-04-15 06:54:13,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:13,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:13,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:13,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-04-15 06:54:13,714 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 113 [2022-04-15 06:54:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:13,714 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-04-15 06:54:13,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.6333333333333333) internal successors, (109), 29 states have internal predecessors, (109), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:13,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 124 transitions. [2022-04-15 06:54:13,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-15 06:54:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 06:54:13,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:13,926 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:13,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:14,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:54:14,126 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1355859937, now seen corresponding path program 24 times [2022-04-15 06:54:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:14,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1731040451] [2022-04-15 06:54:18,202 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:18,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:18,474 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:22,613 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:22,757 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:22,758 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1645827929, now seen corresponding path program 1 times [2022-04-15 06:54:22,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:22,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393211824] [2022-04-15 06:54:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {16050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16041#true} is VALID [2022-04-15 06:54:22,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {16041#true} assume true; {16041#true} is VALID [2022-04-15 06:54:22,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16041#true} {16041#true} #48#return; {16041#true} is VALID [2022-04-15 06:54:22,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {16041#true} call ULTIMATE.init(); {16050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:22,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {16050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16041#true} is VALID [2022-04-15 06:54:22,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {16041#true} assume true; {16041#true} is VALID [2022-04-15 06:54:22,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16041#true} {16041#true} #48#return; {16041#true} is VALID [2022-04-15 06:54:22,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {16041#true} call #t~ret7 := main(); {16041#true} is VALID [2022-04-15 06:54:22,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {16041#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {16046#(= main_~x~0 0)} is VALID [2022-04-15 06:54:22,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {16046#(= main_~x~0 0)} [198] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_177| |v_main_#t~post4_176|)) (.cse1 (= v_main_~x~0_938 v_main_~x~0_937))) (or (and .cse0 .cse1) (and (< v_main_~x~0_938 v_main_~x~0_937) (< v_main_~x~0_937 500001)) (and (not (< v_main_~x~0_938 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_938, main_#t~post4=|v_main_#t~post4_177|} OutVars{main_~x~0=v_main_~x~0_937, main_#t~post4=|v_main_#t~post4_176|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16047#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:22,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {16047#(<= main_~x~0 500000)} [199] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16047#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:22,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {16047#(<= main_~x~0 500000)} [200] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 750000 v_main_~x~0_940)) (.cse0 (= v_main_~y~0_682 v_main_~y~0_681))) (or (and (= |v_main_#t~post6_309| |v_main_#t~post6_311|) (= v_main_~x~0_939 v_main_~x~0_940) .cse0 (or (not .cse1) (not (< v_main_~x~0_940 1000000)))) (and (< v_main_~y~0_682 v_main_~y~0_681) (= (+ v_main_~x~0_939 (* v_main_~y~0_682 2)) (+ v_main_~x~0_940 (* v_main_~y~0_681 2))) .cse1 (< v_main_~y~0_681 (+ v_main_~y~0_682 (div (+ 999999 (* v_main_~x~0_940 (- 1))) 2) 2))) (and (= v_main_~x~0_940 v_main_~x~0_939) (= |v_main_#t~post6_311| |v_main_#t~post6_309|) .cse0))) InVars {main_~y~0=v_main_~y~0_682, main_~x~0=v_main_~x~0_940, main_#t~post6=|v_main_#t~post6_311|} OutVars{main_~y~0=v_main_~y~0_681, main_~x~0=v_main_~x~0_939, main_#t~post6=|v_main_#t~post6_309|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {16048#(<= main_~x~0 749999)} is VALID [2022-04-15 06:54:22,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {16048#(<= main_~x~0 749999)} [201] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16048#(<= main_~x~0 749999)} is VALID [2022-04-15 06:54:22,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {16048#(<= main_~x~0 749999)} [202] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_942)) (.cse2 (= v_main_~x~0_942 v_main_~x~0_941)) (.cse3 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (= |v_main_#t~post6_314| |v_main_#t~post6_310|)) (.cse5 (= v_main_~y~0_684 v_main_~y~0_683))) (or (let ((.cse1 (+ v_main_~x~0_942 v_main_~y~0_683))) (and .cse0 (< v_main_~y~0_684 v_main_~y~0_683) (= .cse1 (+ v_main_~x~0_941 v_main_~y~0_684)) (< .cse1 (+ 750001 v_main_~y~0_684)))) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_942 750000)) (not .cse0))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_684, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_942, main_#t~post6=|v_main_#t~post6_314|} OutVars{main_~y~0=v_main_~y~0_683, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_941, main_#t~post6=|v_main_#t~post6_310|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16049#(<= main_~x~0 750000)} is VALID [2022-04-15 06:54:22,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {16049#(<= main_~x~0 750000)} [197] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {16042#false} is VALID [2022-04-15 06:54:22,815 INFO L272 TraceCheckUtils]: 12: Hoare triple {16042#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {16042#false} is VALID [2022-04-15 06:54:22,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {16042#false} ~cond := #in~cond; {16042#false} is VALID [2022-04-15 06:54:22,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {16042#false} assume 0 == ~cond; {16042#false} is VALID [2022-04-15 06:54:22,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {16042#false} assume !false; {16042#false} is VALID [2022-04-15 06:54:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:54:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393211824] [2022-04-15 06:54:22,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393211824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:22,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257077587] [2022-04-15 06:54:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:22,817 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:22,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:54:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:54:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:22,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:22,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {16041#true} call ULTIMATE.init(); {16041#true} is VALID [2022-04-15 06:54:23,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {16041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16041#true} is VALID [2022-04-15 06:54:23,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {16041#true} assume true; {16041#true} is VALID [2022-04-15 06:54:23,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16041#true} {16041#true} #48#return; {16041#true} is VALID [2022-04-15 06:54:23,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {16041#true} call #t~ret7 := main(); {16041#true} is VALID [2022-04-15 06:54:23,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {16041#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {16069#(<= main_~x~0 0)} is VALID [2022-04-15 06:54:23,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {16069#(<= main_~x~0 0)} [198] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_177| |v_main_#t~post4_176|)) (.cse1 (= v_main_~x~0_938 v_main_~x~0_937))) (or (and .cse0 .cse1) (and (< v_main_~x~0_938 v_main_~x~0_937) (< v_main_~x~0_937 500001)) (and (not (< v_main_~x~0_938 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_938, main_#t~post4=|v_main_#t~post4_177|} OutVars{main_~x~0=v_main_~x~0_937, main_#t~post4=|v_main_#t~post4_176|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16047#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:23,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {16047#(<= main_~x~0 500000)} [199] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16047#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:23,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {16047#(<= main_~x~0 500000)} [200] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 750000 v_main_~x~0_940)) (.cse0 (= v_main_~y~0_682 v_main_~y~0_681))) (or (and (= |v_main_#t~post6_309| |v_main_#t~post6_311|) (= v_main_~x~0_939 v_main_~x~0_940) .cse0 (or (not .cse1) (not (< v_main_~x~0_940 1000000)))) (and (< v_main_~y~0_682 v_main_~y~0_681) (= (+ v_main_~x~0_939 (* v_main_~y~0_682 2)) (+ v_main_~x~0_940 (* v_main_~y~0_681 2))) .cse1 (< v_main_~y~0_681 (+ v_main_~y~0_682 (div (+ 999999 (* v_main_~x~0_940 (- 1))) 2) 2))) (and (= v_main_~x~0_940 v_main_~x~0_939) (= |v_main_#t~post6_311| |v_main_#t~post6_309|) .cse0))) InVars {main_~y~0=v_main_~y~0_682, main_~x~0=v_main_~x~0_940, main_#t~post6=|v_main_#t~post6_311|} OutVars{main_~y~0=v_main_~y~0_681, main_~x~0=v_main_~x~0_939, main_#t~post6=|v_main_#t~post6_309|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {16047#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:23,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {16047#(<= main_~x~0 500000)} [201] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16047#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:23,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {16047#(<= main_~x~0 500000)} [202] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_942)) (.cse2 (= v_main_~x~0_942 v_main_~x~0_941)) (.cse3 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (= |v_main_#t~post6_314| |v_main_#t~post6_310|)) (.cse5 (= v_main_~y~0_684 v_main_~y~0_683))) (or (let ((.cse1 (+ v_main_~x~0_942 v_main_~y~0_683))) (and .cse0 (< v_main_~y~0_684 v_main_~y~0_683) (= .cse1 (+ v_main_~x~0_941 v_main_~y~0_684)) (< .cse1 (+ 750001 v_main_~y~0_684)))) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_942 750000)) (not .cse0))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_684, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_942, main_#t~post6=|v_main_#t~post6_314|} OutVars{main_~y~0=v_main_~y~0_683, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_941, main_#t~post6=|v_main_#t~post6_310|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16049#(<= main_~x~0 750000)} is VALID [2022-04-15 06:54:23,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {16049#(<= main_~x~0 750000)} [197] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {16042#false} is VALID [2022-04-15 06:54:23,004 INFO L272 TraceCheckUtils]: 12: Hoare triple {16042#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {16042#false} is VALID [2022-04-15 06:54:23,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {16042#false} ~cond := #in~cond; {16042#false} is VALID [2022-04-15 06:54:23,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {16042#false} assume 0 == ~cond; {16042#false} is VALID [2022-04-15 06:54:23,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {16042#false} assume !false; {16042#false} is VALID [2022-04-15 06:54:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:23,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:23,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {16042#false} assume !false; {16042#false} is VALID [2022-04-15 06:54:23,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {16103#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16042#false} is VALID [2022-04-15 06:54:23,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {16107#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16103#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:23,414 INFO L272 TraceCheckUtils]: 12: Hoare triple {16111#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {16107#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:23,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {16115#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [197] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {16111#(= main_~x~0 1000000)} is VALID [2022-04-15 06:54:23,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {16115#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [202] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_942)) (.cse2 (= v_main_~x~0_942 v_main_~x~0_941)) (.cse3 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (= |v_main_#t~post6_314| |v_main_#t~post6_310|)) (.cse5 (= v_main_~y~0_684 v_main_~y~0_683))) (or (let ((.cse1 (+ v_main_~x~0_942 v_main_~y~0_683))) (and .cse0 (< v_main_~y~0_684 v_main_~y~0_683) (= .cse1 (+ v_main_~x~0_941 v_main_~y~0_684)) (< .cse1 (+ 750001 v_main_~y~0_684)))) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_942 750000)) (not .cse0))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_684, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_942, main_#t~post6=|v_main_#t~post6_314|} OutVars{main_~y~0=v_main_~y~0_683, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_941, main_#t~post6=|v_main_#t~post6_310|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16115#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:54:23,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {16115#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [201] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16115#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:54:23,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {16125#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [200] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 750000 v_main_~x~0_940)) (.cse0 (= v_main_~y~0_682 v_main_~y~0_681))) (or (and (= |v_main_#t~post6_309| |v_main_#t~post6_311|) (= v_main_~x~0_939 v_main_~x~0_940) .cse0 (or (not .cse1) (not (< v_main_~x~0_940 1000000)))) (and (< v_main_~y~0_682 v_main_~y~0_681) (= (+ v_main_~x~0_939 (* v_main_~y~0_682 2)) (+ v_main_~x~0_940 (* v_main_~y~0_681 2))) .cse1 (< v_main_~y~0_681 (+ v_main_~y~0_682 (div (+ 999999 (* v_main_~x~0_940 (- 1))) 2) 2))) (and (= v_main_~x~0_940 v_main_~x~0_939) (= |v_main_#t~post6_311| |v_main_#t~post6_309|) .cse0))) InVars {main_~y~0=v_main_~y~0_682, main_~x~0=v_main_~x~0_940, main_#t~post6=|v_main_#t~post6_311|} OutVars{main_~y~0=v_main_~y~0_681, main_~x~0=v_main_~x~0_939, main_#t~post6=|v_main_#t~post6_309|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {16115#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:54:23,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {16125#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [199] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16125#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:54:23,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {16125#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [198] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_177| |v_main_#t~post4_176|)) (.cse1 (= v_main_~x~0_938 v_main_~x~0_937))) (or (and .cse0 .cse1) (and (< v_main_~x~0_938 v_main_~x~0_937) (< v_main_~x~0_937 500001)) (and (not (< v_main_~x~0_938 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_938, main_#t~post4=|v_main_#t~post4_177|} OutVars{main_~x~0=v_main_~x~0_937, main_#t~post4=|v_main_#t~post4_176|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16125#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:54:23,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {16041#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {16125#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:54:23,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {16041#true} call #t~ret7 := main(); {16041#true} is VALID [2022-04-15 06:54:23,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16041#true} {16041#true} #48#return; {16041#true} is VALID [2022-04-15 06:54:23,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {16041#true} assume true; {16041#true} is VALID [2022-04-15 06:54:23,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {16041#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {16041#true} is VALID [2022-04-15 06:54:23,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {16041#true} call ULTIMATE.init(); {16041#true} is VALID [2022-04-15 06:54:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:23,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257077587] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:23,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:23,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 13 [2022-04-15 06:54:24,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:24,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1731040451] [2022-04-15 06:54:24,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1731040451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:24,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:24,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:54:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019284645] [2022-04-15 06:54:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:24,308 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 06:54:24,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:24,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:24,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:24,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:54:24,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:24,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:54:24,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1419, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:54:24,390 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:29,987 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-04-15 06:54:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:54:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-04-15 06:54:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 136 transitions. [2022-04-15 06:54:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 136 transitions. [2022-04-15 06:54:29,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 136 transitions. [2022-04-15 06:54:30,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:30,097 INFO L225 Difference]: With dead ends: 147 [2022-04-15 06:54:30,097 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 06:54:30,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=454, Invalid=4238, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:54:30,097 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:30,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 169 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 06:54:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 06:54:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2022-04-15 06:54:31,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:31,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:31,314 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:31,314 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:31,316 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-15 06:54:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-15 06:54:31,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:31,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:31,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 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 06:54:31,317 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 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 06:54:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:31,318 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-15 06:54:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-15 06:54:31,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:31,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:31,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:31,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-04-15 06:54:31,320 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 117 [2022-04-15 06:54:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:31,321 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-04-15 06:54:31,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.6451612903225805) internal successors, (113), 30 states have internal predecessors, (113), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:31,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 128 transitions. [2022-04-15 06:54:31,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-15 06:54:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 06:54:31,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:31,561 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:31,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:31,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:54:31,761 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:31,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1136388086, now seen corresponding path program 25 times [2022-04-15 06:54:31,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:31,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [452778534] [2022-04-15 06:54:31,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:32,074 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:32,292 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:32,293 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:32,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2005402905, now seen corresponding path program 1 times [2022-04-15 06:54:32,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:32,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904250764] [2022-04-15 06:54:32,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:32,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:32,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {17047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17036#true} is VALID [2022-04-15 06:54:32,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {17036#true} assume true; {17036#true} is VALID [2022-04-15 06:54:32,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17036#true} {17036#true} #48#return; {17036#true} is VALID [2022-04-15 06:54:32,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {17036#true} call ULTIMATE.init(); {17047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:32,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {17047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17036#true} is VALID [2022-04-15 06:54:32,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {17036#true} assume true; {17036#true} is VALID [2022-04-15 06:54:32,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17036#true} {17036#true} #48#return; {17036#true} is VALID [2022-04-15 06:54:32,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {17036#true} call #t~ret7 := main(); {17036#true} is VALID [2022-04-15 06:54:32,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {17036#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17041#(= main_~x~0 0)} is VALID [2022-04-15 06:54:32,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {17041#(= main_~x~0 0)} [204] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_989 v_main_~x~0_988))) (or (and .cse0 .cse1 (not (< v_main_~x~0_989 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_988 500001) (< v_main_~x~0_989 v_main_~x~0_988)))) InVars {main_~x~0=v_main_~x~0_989, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_988, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {17042#(<= main_~x~0 500000)} [205] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {17042#(<= main_~x~0 500000)} [206] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_991 v_main_~x~0_990)) (.cse1 (= v_main_~y~0_723 v_main_~y~0_722)) (.cse2 (= |v_main_#t~post6_324| |v_main_#t~post6_322|)) (.cse3 (<= 750000 v_main_~x~0_991))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_991 1000000)) (not .cse3))) (and (< v_main_~y~0_722 (+ v_main_~y~0_723 (div (+ 999999 (* v_main_~x~0_991 (- 1))) 2) 2)) (< v_main_~y~0_723 v_main_~y~0_722) (= (+ v_main_~x~0_990 (* v_main_~y~0_723 2)) (+ v_main_~x~0_991 (* v_main_~y~0_722 2))) .cse3))) InVars {main_~y~0=v_main_~y~0_723, main_~x~0=v_main_~x~0_991, main_#t~post6=|v_main_#t~post6_324|} OutVars{main_~y~0=v_main_~y~0_722, main_~x~0=v_main_~x~0_990, main_#t~post6=|v_main_#t~post6_322|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {17042#(<= main_~x~0 500000)} [207] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {17042#(<= main_~x~0 500000)} [208] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_725 v_main_~y~0_724)) (.cse1 (= |v_main_#t~post6_327| |v_main_#t~post6_323|)) (.cse2 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse3 (= v_main_~x~0_993 v_main_~x~0_992)) (.cse4 (<= 500000 v_main_~x~0_993))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_993 750000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_993 v_main_~y~0_724))) (and (= .cse5 (+ v_main_~x~0_992 v_main_~y~0_725)) (< v_main_~y~0_725 v_main_~y~0_724) .cse4 (< .cse5 (+ 750001 v_main_~y~0_725)))))) InVars {main_~y~0=v_main_~y~0_725, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_993, main_#t~post6=|v_main_#t~post6_327|} OutVars{main_~y~0=v_main_~y~0_724, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_992, main_#t~post6=|v_main_#t~post6_323|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17043#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:54:32,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {17043#(<= main_~x~0 1000000)} [203] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {17044#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} is VALID [2022-04-15 06:54:32,378 INFO L272 TraceCheckUtils]: 12: Hoare triple {17044#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {17045#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:54:32,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {17045#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {17046#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:32,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {17046#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17037#false} is VALID [2022-04-15 06:54:32,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#false} assume !false; {17037#false} is VALID [2022-04-15 06:54:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:32,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:32,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904250764] [2022-04-15 06:54:32,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904250764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:32,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241018447] [2022-04-15 06:54:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:32,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:32,383 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:32,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:54:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:32,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:54:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:32,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:32,605 INFO L272 TraceCheckUtils]: 0: Hoare triple {17036#true} call ULTIMATE.init(); {17036#true} is VALID [2022-04-15 06:54:32,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {17036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17036#true} is VALID [2022-04-15 06:54:32,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {17036#true} assume true; {17036#true} is VALID [2022-04-15 06:54:32,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17036#true} {17036#true} #48#return; {17036#true} is VALID [2022-04-15 06:54:32,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {17036#true} call #t~ret7 := main(); {17036#true} is VALID [2022-04-15 06:54:32,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {17036#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17066#(<= main_~x~0 0)} is VALID [2022-04-15 06:54:32,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {17066#(<= main_~x~0 0)} [204] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_989 v_main_~x~0_988))) (or (and .cse0 .cse1 (not (< v_main_~x~0_989 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_988 500001) (< v_main_~x~0_989 v_main_~x~0_988)))) InVars {main_~x~0=v_main_~x~0_989, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_988, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {17042#(<= main_~x~0 500000)} [205] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {17042#(<= main_~x~0 500000)} [206] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_991 v_main_~x~0_990)) (.cse1 (= v_main_~y~0_723 v_main_~y~0_722)) (.cse2 (= |v_main_#t~post6_324| |v_main_#t~post6_322|)) (.cse3 (<= 750000 v_main_~x~0_991))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_991 1000000)) (not .cse3))) (and (< v_main_~y~0_722 (+ v_main_~y~0_723 (div (+ 999999 (* v_main_~x~0_991 (- 1))) 2) 2)) (< v_main_~y~0_723 v_main_~y~0_722) (= (+ v_main_~x~0_990 (* v_main_~y~0_723 2)) (+ v_main_~x~0_991 (* v_main_~y~0_722 2))) .cse3))) InVars {main_~y~0=v_main_~y~0_723, main_~x~0=v_main_~x~0_991, main_#t~post6=|v_main_#t~post6_324|} OutVars{main_~y~0=v_main_~y~0_722, main_~x~0=v_main_~x~0_990, main_#t~post6=|v_main_#t~post6_322|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {17042#(<= main_~x~0 500000)} [207] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17042#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:32,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {17042#(<= main_~x~0 500000)} [208] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_725 v_main_~y~0_724)) (.cse1 (= |v_main_#t~post6_327| |v_main_#t~post6_323|)) (.cse2 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse3 (= v_main_~x~0_993 v_main_~x~0_992)) (.cse4 (<= 500000 v_main_~x~0_993))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_993 750000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_993 v_main_~y~0_724))) (and (= .cse5 (+ v_main_~x~0_992 v_main_~y~0_725)) (< v_main_~y~0_725 v_main_~y~0_724) .cse4 (< .cse5 (+ 750001 v_main_~y~0_725)))))) InVars {main_~y~0=v_main_~y~0_725, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_993, main_#t~post6=|v_main_#t~post6_327|} OutVars{main_~y~0=v_main_~y~0_724, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_992, main_#t~post6=|v_main_#t~post6_323|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17082#(< main_~x~0 750001)} is VALID [2022-04-15 06:54:32,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {17082#(< main_~x~0 750001)} [203] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {17037#false} is VALID [2022-04-15 06:54:32,610 INFO L272 TraceCheckUtils]: 12: Hoare triple {17037#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {17037#false} is VALID [2022-04-15 06:54:32,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {17037#false} ~cond := #in~cond; {17037#false} is VALID [2022-04-15 06:54:32,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {17037#false} assume 0 == ~cond; {17037#false} is VALID [2022-04-15 06:54:32,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#false} assume !false; {17037#false} is VALID [2022-04-15 06:54:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:32,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:43,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#false} assume !false; {17037#false} is VALID [2022-04-15 06:54:43,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {17101#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {17037#false} is VALID [2022-04-15 06:54:43,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {17105#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17101#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:54:43,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {17044#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {17105#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:54:43,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {17043#(<= main_~x~0 1000000)} [203] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {17044#(and (<= main_~x~0 1000000) (< 999999 main_~x~0))} is VALID [2022-04-15 06:54:43,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {17043#(<= main_~x~0 1000000)} [208] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_725 v_main_~y~0_724)) (.cse1 (= |v_main_#t~post6_327| |v_main_#t~post6_323|)) (.cse2 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse3 (= v_main_~x~0_993 v_main_~x~0_992)) (.cse4 (<= 500000 v_main_~x~0_993))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not (< v_main_~x~0_993 750000)) (not .cse4)) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_993 v_main_~y~0_724))) (and (= .cse5 (+ v_main_~x~0_992 v_main_~y~0_725)) (< v_main_~y~0_725 v_main_~y~0_724) .cse4 (< .cse5 (+ 750001 v_main_~y~0_725)))))) InVars {main_~y~0=v_main_~y~0_725, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_993, main_#t~post6=|v_main_#t~post6_327|} OutVars{main_~y~0=v_main_~y~0_724, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_992, main_#t~post6=|v_main_#t~post6_323|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17043#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:54:43,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {17043#(<= main_~x~0 1000000)} [207] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17043#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:54:43,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {17121#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (<= main_~x~0 1000000))} [206] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_991 v_main_~x~0_990)) (.cse1 (= v_main_~y~0_723 v_main_~y~0_722)) (.cse2 (= |v_main_#t~post6_324| |v_main_#t~post6_322|)) (.cse3 (<= 750000 v_main_~x~0_991))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_991 1000000)) (not .cse3))) (and (< v_main_~y~0_722 (+ v_main_~y~0_723 (div (+ 999999 (* v_main_~x~0_991 (- 1))) 2) 2)) (< v_main_~y~0_723 v_main_~y~0_722) (= (+ v_main_~x~0_990 (* v_main_~y~0_723 2)) (+ v_main_~x~0_991 (* v_main_~y~0_722 2))) .cse3))) InVars {main_~y~0=v_main_~y~0_723, main_~x~0=v_main_~x~0_991, main_#t~post6=|v_main_#t~post6_324|} OutVars{main_~y~0=v_main_~y~0_722, main_~x~0=v_main_~x~0_990, main_#t~post6=|v_main_#t~post6_322|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {17043#(<= main_~x~0 1000000)} is VALID [2022-04-15 06:54:43,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {17121#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (<= main_~x~0 1000000))} [205] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17121#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (<= main_~x~0 1000000))} is VALID [2022-04-15 06:54:43,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {17121#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (<= main_~x~0 1000000))} [204] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_989 v_main_~x~0_988))) (or (and .cse0 .cse1 (not (< v_main_~x~0_989 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_988 500001) (< v_main_~x~0_989 v_main_~x~0_988)))) InVars {main_~x~0=v_main_~x~0_989, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_988, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17121#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (<= main_~x~0 1000000))} is VALID [2022-04-15 06:54:43,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {17036#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17121#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (<= main_~x~0 1000000))} is VALID [2022-04-15 06:54:43,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {17036#true} call #t~ret7 := main(); {17036#true} is VALID [2022-04-15 06:54:43,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17036#true} {17036#true} #48#return; {17036#true} is VALID [2022-04-15 06:54:43,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {17036#true} assume true; {17036#true} is VALID [2022-04-15 06:54:43,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {17036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {17036#true} is VALID [2022-04-15 06:54:43,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {17036#true} call ULTIMATE.init(); {17036#true} is VALID [2022-04-15 06:54:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:43,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241018447] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:43,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:43,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 7] total 14 [2022-04-15 06:54:44,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:44,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [452778534] [2022-04-15 06:54:44,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [452778534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:44,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:44,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:54:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106651057] [2022-04-15 06:54:44,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 06:54:44,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:44,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:44,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:44,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:54:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:54:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1610, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:54:44,999 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:51,478 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-04-15 06:54:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:54:51,479 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-04-15 06:54:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 140 transitions. [2022-04-15 06:54:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 140 transitions. [2022-04-15 06:54:51,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 140 transitions. [2022-04-15 06:54:51,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:51,589 INFO L225 Difference]: With dead ends: 151 [2022-04-15 06:54:51,589 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 06:54:51,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 109 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=408, Invalid=4704, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:54:51,590 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:51,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 190 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3491 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:54:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 06:54:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2022-04-15 06:54:52,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:52,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:52,888 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:52,888 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:52,890 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2022-04-15 06:54:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2022-04-15 06:54:52,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:52,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:52,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 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 133 states. [2022-04-15 06:54:52,890 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 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 133 states. [2022-04-15 06:54:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:52,892 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2022-04-15 06:54:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2022-04-15 06:54:52,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:52,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:52,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:52,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 states have internal predecessors, (128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-04-15 06:54:52,894 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 121 [2022-04-15 06:54:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:52,894 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-04-15 06:54:52,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.4411764705882355) internal successors, (117), 33 states have internal predecessors, (117), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:54:52,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 132 transitions. [2022-04-15 06:54:53,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-04-15 06:54:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 06:54:53,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:53,131 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:53,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:53,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:54:53,332 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1613681741, now seen corresponding path program 26 times [2022-04-15 06:54:53,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:53,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373318320] [2022-04-15 06:54:53,461 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:53,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:54,100 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:54,101 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1929989415, now seen corresponding path program 1 times [2022-04-15 06:54:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:54,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498017414] [2022-04-15 06:54:54,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:54,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:54,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {18067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18059#true} is VALID [2022-04-15 06:54:54,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {18059#true} assume true; {18059#true} is VALID [2022-04-15 06:54:54,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18059#true} {18059#true} #48#return; {18059#true} is VALID [2022-04-15 06:54:54,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {18059#true} call ULTIMATE.init(); {18067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:54,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {18067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18059#true} is VALID [2022-04-15 06:54:54,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {18059#true} assume true; {18059#true} is VALID [2022-04-15 06:54:54,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18059#true} {18059#true} #48#return; {18059#true} is VALID [2022-04-15 06:54:54,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {18059#true} call #t~ret7 := main(); {18059#true} is VALID [2022-04-15 06:54:54,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {18059#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18064#(= main_~x~0 0)} is VALID [2022-04-15 06:54:54,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {18064#(= main_~x~0 0)} [210] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1041 v_main_~x~0_1040))) (or (and (< v_main_~x~0_1041 v_main_~x~0_1040) (< v_main_~x~0_1040 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1041 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1040, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {18065#(<= main_~x~0 500000)} [211] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {18065#(<= main_~x~0 500000)} [212] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1043)) (.cse1 (= v_main_~x~0_1043 v_main_~x~0_1042)) (.cse2 (= v_main_~y~0_765 v_main_~y~0_764)) (.cse3 (= |v_main_#t~post6_337| |v_main_#t~post6_335|))) (or (and .cse0 (< v_main_~y~0_764 (+ v_main_~y~0_765 2 (div (+ 999999 (* (- 1) v_main_~x~0_1043)) 2))) (< v_main_~y~0_765 v_main_~y~0_764) (= (+ v_main_~x~0_1043 (* v_main_~y~0_764 2)) (+ v_main_~x~0_1042 (* v_main_~y~0_765 2)))) (and .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1043 1000000)) (not .cse0)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_765, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_337|} OutVars{main_~y~0=v_main_~y~0_764, main_~x~0=v_main_~x~0_1042, main_#t~post6=|v_main_#t~post6_335|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {18065#(<= main_~x~0 500000)} [213] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {18065#(<= main_~x~0 500000)} [214] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1045)) (.cse2 (= v_main_~y~0_767 v_main_~y~0_766)) (.cse3 (= v_main_~x~0_1045 v_main_~x~0_1044)) (.cse4 (= |v_main_#t~post5_161| |v_main_#t~post5_160|))) (or (let ((.cse1 (+ v_main_~x~0_1045 v_main_~y~0_766))) (and .cse0 (< .cse1 (+ 750001 v_main_~y~0_767)) (= .cse1 (+ v_main_~x~0_1044 v_main_~y~0_767)) (< v_main_~y~0_767 v_main_~y~0_766))) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1045 750000))) (= |v_main_#t~post6_336| |v_main_#t~post6_340|) .cse4) (and .cse2 .cse3 (= |v_main_#t~post6_340| |v_main_#t~post6_336|) .cse4))) InVars {main_~y~0=v_main_~y~0_767, main_#t~post5=|v_main_#t~post5_161|, main_~x~0=v_main_~x~0_1045, main_#t~post6=|v_main_#t~post6_340|} OutVars{main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_336|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18066#(<= main_~x~0 750000)} is VALID [2022-04-15 06:54:54,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {18066#(<= main_~x~0 750000)} [209] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {18060#false} is VALID [2022-04-15 06:54:54,154 INFO L272 TraceCheckUtils]: 12: Hoare triple {18060#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {18060#false} is VALID [2022-04-15 06:54:54,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {18060#false} ~cond := #in~cond; {18060#false} is VALID [2022-04-15 06:54:54,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {18060#false} assume 0 == ~cond; {18060#false} is VALID [2022-04-15 06:54:54,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {18060#false} assume !false; {18060#false} is VALID [2022-04-15 06:54:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:54,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:54,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498017414] [2022-04-15 06:54:54,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498017414] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:54,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611142763] [2022-04-15 06:54:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:54,160 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:54,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:54:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:54,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:54:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:54,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:54,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {18059#true} call ULTIMATE.init(); {18059#true} is VALID [2022-04-15 06:54:54,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {18059#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18059#true} is VALID [2022-04-15 06:54:54,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {18059#true} assume true; {18059#true} is VALID [2022-04-15 06:54:54,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18059#true} {18059#true} #48#return; {18059#true} is VALID [2022-04-15 06:54:54,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {18059#true} call #t~ret7 := main(); {18059#true} is VALID [2022-04-15 06:54:54,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {18059#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18086#(<= main_~x~0 0)} is VALID [2022-04-15 06:54:54,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {18086#(<= main_~x~0 0)} [210] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1041 v_main_~x~0_1040))) (or (and (< v_main_~x~0_1041 v_main_~x~0_1040) (< v_main_~x~0_1040 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1041 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1040, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {18065#(<= main_~x~0 500000)} [211] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {18065#(<= main_~x~0 500000)} [212] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1043)) (.cse1 (= v_main_~x~0_1043 v_main_~x~0_1042)) (.cse2 (= v_main_~y~0_765 v_main_~y~0_764)) (.cse3 (= |v_main_#t~post6_337| |v_main_#t~post6_335|))) (or (and .cse0 (< v_main_~y~0_764 (+ v_main_~y~0_765 2 (div (+ 999999 (* (- 1) v_main_~x~0_1043)) 2))) (< v_main_~y~0_765 v_main_~y~0_764) (= (+ v_main_~x~0_1043 (* v_main_~y~0_764 2)) (+ v_main_~x~0_1042 (* v_main_~y~0_765 2)))) (and .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1043 1000000)) (not .cse0)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_765, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_337|} OutVars{main_~y~0=v_main_~y~0_764, main_~x~0=v_main_~x~0_1042, main_#t~post6=|v_main_#t~post6_335|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {18065#(<= main_~x~0 500000)} [213] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18065#(<= main_~x~0 500000)} is VALID [2022-04-15 06:54:54,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {18065#(<= main_~x~0 500000)} [214] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1045)) (.cse2 (= v_main_~y~0_767 v_main_~y~0_766)) (.cse3 (= v_main_~x~0_1045 v_main_~x~0_1044)) (.cse4 (= |v_main_#t~post5_161| |v_main_#t~post5_160|))) (or (let ((.cse1 (+ v_main_~x~0_1045 v_main_~y~0_766))) (and .cse0 (< .cse1 (+ 750001 v_main_~y~0_767)) (= .cse1 (+ v_main_~x~0_1044 v_main_~y~0_767)) (< v_main_~y~0_767 v_main_~y~0_766))) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1045 750000))) (= |v_main_#t~post6_336| |v_main_#t~post6_340|) .cse4) (and .cse2 .cse3 (= |v_main_#t~post6_340| |v_main_#t~post6_336|) .cse4))) InVars {main_~y~0=v_main_~y~0_767, main_#t~post5=|v_main_#t~post5_161|, main_~x~0=v_main_~x~0_1045, main_#t~post6=|v_main_#t~post6_340|} OutVars{main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_336|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18066#(<= main_~x~0 750000)} is VALID [2022-04-15 06:54:54,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {18066#(<= main_~x~0 750000)} [209] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {18060#false} is VALID [2022-04-15 06:54:54,353 INFO L272 TraceCheckUtils]: 12: Hoare triple {18060#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {18060#false} is VALID [2022-04-15 06:54:54,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {18060#false} ~cond := #in~cond; {18060#false} is VALID [2022-04-15 06:54:54,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {18060#false} assume 0 == ~cond; {18060#false} is VALID [2022-04-15 06:54:54,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {18060#false} assume !false; {18060#false} is VALID [2022-04-15 06:54:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:54,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:07,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {18060#false} assume !false; {18060#false} is VALID [2022-04-15 06:55:07,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {18120#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18060#false} is VALID [2022-04-15 06:55:07,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {18124#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18120#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:07,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {18128#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {18124#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:07,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {18132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [209] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {18128#(= main_~x~0 1000000)} is VALID [2022-04-15 06:55:07,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {18132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [214] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1045)) (.cse2 (= v_main_~y~0_767 v_main_~y~0_766)) (.cse3 (= v_main_~x~0_1045 v_main_~x~0_1044)) (.cse4 (= |v_main_#t~post5_161| |v_main_#t~post5_160|))) (or (let ((.cse1 (+ v_main_~x~0_1045 v_main_~y~0_766))) (and .cse0 (< .cse1 (+ 750001 v_main_~y~0_767)) (= .cse1 (+ v_main_~x~0_1044 v_main_~y~0_767)) (< v_main_~y~0_767 v_main_~y~0_766))) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1045 750000))) (= |v_main_#t~post6_336| |v_main_#t~post6_340|) .cse4) (and .cse2 .cse3 (= |v_main_#t~post6_340| |v_main_#t~post6_336|) .cse4))) InVars {main_~y~0=v_main_~y~0_767, main_#t~post5=|v_main_#t~post5_161|, main_~x~0=v_main_~x~0_1045, main_#t~post6=|v_main_#t~post6_340|} OutVars{main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_1044, main_#t~post6=|v_main_#t~post6_336|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:07,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {18132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [213] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:07,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {18142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [212] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1043)) (.cse1 (= v_main_~x~0_1043 v_main_~x~0_1042)) (.cse2 (= v_main_~y~0_765 v_main_~y~0_764)) (.cse3 (= |v_main_#t~post6_337| |v_main_#t~post6_335|))) (or (and .cse0 (< v_main_~y~0_764 (+ v_main_~y~0_765 2 (div (+ 999999 (* (- 1) v_main_~x~0_1043)) 2))) (< v_main_~y~0_765 v_main_~y~0_764) (= (+ v_main_~x~0_1043 (* v_main_~y~0_764 2)) (+ v_main_~x~0_1042 (* v_main_~y~0_765 2)))) (and .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1043 1000000)) (not .cse0)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_765, main_~x~0=v_main_~x~0_1043, main_#t~post6=|v_main_#t~post6_337|} OutVars{main_~y~0=v_main_~y~0_764, main_~x~0=v_main_~x~0_1042, main_#t~post6=|v_main_#t~post6_335|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {18132#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:07,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {18142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [211] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:55:07,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {18142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [210] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1041 v_main_~x~0_1040))) (or (and (< v_main_~x~0_1041 v_main_~x~0_1040) (< v_main_~x~0_1040 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1041 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1041, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1040, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:55:07,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {18059#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18142#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:55:07,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {18059#true} call #t~ret7 := main(); {18059#true} is VALID [2022-04-15 06:55:07,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18059#true} {18059#true} #48#return; {18059#true} is VALID [2022-04-15 06:55:07,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {18059#true} assume true; {18059#true} is VALID [2022-04-15 06:55:07,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {18059#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {18059#true} is VALID [2022-04-15 06:55:07,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {18059#true} call ULTIMATE.init(); {18059#true} is VALID [2022-04-15 06:55:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:07,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611142763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:07,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:07,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:55:08,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:08,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373318320] [2022-04-15 06:55:08,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373318320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:08,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:08,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:55:08,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712540929] [2022-04-15 06:55:08,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:08,009 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 06:55:08,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:08,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:08,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:08,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:55:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:08,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:55:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:55:08,108 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:14,616 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-04-15 06:55:14,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:55:14,616 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 06:55:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 144 transitions. [2022-04-15 06:55:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 144 transitions. [2022-04-15 06:55:14,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 144 transitions. [2022-04-15 06:55:14,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:14,728 INFO L225 Difference]: With dead ends: 155 [2022-04-15 06:55:14,729 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 06:55:14,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=414, Invalid=4698, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:55:14,729 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 95 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3484 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:14,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 186 Invalid, 3517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3484 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:55:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 06:55:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2022-04-15 06:55:16,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:16,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:16,131 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:16,131 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:16,132 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2022-04-15 06:55:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2022-04-15 06:55:16,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:16,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:16,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 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 137 states. [2022-04-15 06:55:16,133 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 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 137 states. [2022-04-15 06:55:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:16,134 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2022-04-15 06:55:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2022-04-15 06:55:16,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:16,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:16,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:16,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 states have internal predecessors, (132), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-04-15 06:55:16,137 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 125 [2022-04-15 06:55:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:16,137 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-04-15 06:55:16,137 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 32 states have internal predecessors, (121), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:16,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 136 transitions. [2022-04-15 06:55:16,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:16,393 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-04-15 06:55:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 06:55:16,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:16,394 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:16,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 06:55:16,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:55:16,608 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash -166347484, now seen corresponding path program 27 times [2022-04-15 06:55:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:16,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [593056118] [2022-04-15 06:55:20,673 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:20,723 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:22,653 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:22,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:22,862 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1570414439, now seen corresponding path program 1 times [2022-04-15 06:55:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:22,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858365502] [2022-04-15 06:55:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:22,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:22,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {19115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19107#true} is VALID [2022-04-15 06:55:22,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {19107#true} assume true; {19107#true} is VALID [2022-04-15 06:55:22,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19107#true} {19107#true} #48#return; {19107#true} is VALID [2022-04-15 06:55:22,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {19107#true} call ULTIMATE.init(); {19115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:22,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {19115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19107#true} is VALID [2022-04-15 06:55:22,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {19107#true} assume true; {19107#true} is VALID [2022-04-15 06:55:22,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19107#true} {19107#true} #48#return; {19107#true} is VALID [2022-04-15 06:55:22,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {19107#true} call #t~ret7 := main(); {19107#true} is VALID [2022-04-15 06:55:22,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {19107#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19112#(= main_~x~0 0)} is VALID [2022-04-15 06:55:22,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {19112#(= main_~x~0 0)} [216] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_198| |v_main_#t~post4_197|))) (or (and (< v_main_~x~0_1094 v_main_~x~0_1093) (< v_main_~x~0_1093 500001)) (and (not (< v_main_~x~0_1094 500000)) (= v_main_~x~0_1093 v_main_~x~0_1094) .cse0) (and .cse0 (= v_main_~x~0_1094 v_main_~x~0_1093)))) InVars {main_~x~0=v_main_~x~0_1094, main_#t~post4=|v_main_#t~post4_198|} OutVars{main_~x~0=v_main_~x~0_1093, main_#t~post4=|v_main_#t~post4_197|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19113#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:22,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {19113#(<= main_~x~0 500000)} [217] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19113#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:22,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {19113#(<= main_~x~0 500000)} [218] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1096)) (.cse1 (= v_main_~y~0_808 v_main_~y~0_807)) (.cse2 (= v_main_~x~0_1096 v_main_~x~0_1095)) (.cse3 (= |v_main_#t~post6_350| |v_main_#t~post6_348|))) (or (and (< v_main_~y~0_808 v_main_~y~0_807) .cse0 (< v_main_~y~0_807 (+ (div (+ (* (- 1) v_main_~x~0_1096) 999999) 2) v_main_~y~0_808 2)) (= (+ v_main_~x~0_1096 (* v_main_~y~0_807 2)) (+ v_main_~x~0_1095 (* v_main_~y~0_808 2)))) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1096 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_808, main_~x~0=v_main_~x~0_1096, main_#t~post6=|v_main_#t~post6_350|} OutVars{main_~y~0=v_main_~y~0_807, main_~x~0=v_main_~x~0_1095, main_#t~post6=|v_main_#t~post6_348|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {19113#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:22,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {19113#(<= main_~x~0 500000)} [219] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19113#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:22,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {19113#(<= main_~x~0 500000)} [220] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1098)) (.cse2 (= |v_main_#t~post6_353| |v_main_#t~post6_349|)) (.cse3 (= v_main_~y~0_810 v_main_~y~0_809)) (.cse4 (= |v_main_#t~post5_167| |v_main_#t~post5_166|)) (.cse5 (= v_main_~x~0_1098 v_main_~x~0_1097))) (or (let ((.cse0 (+ v_main_~x~0_1098 v_main_~y~0_809))) (and (< .cse0 (+ 750001 v_main_~y~0_810)) (< v_main_~y~0_810 v_main_~y~0_809) (= .cse0 (+ v_main_~x~0_1097 v_main_~y~0_810)) .cse1)) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1098 750000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_810, main_#t~post5=|v_main_#t~post5_167|, main_~x~0=v_main_~x~0_1098, main_#t~post6=|v_main_#t~post6_353|} OutVars{main_~y~0=v_main_~y~0_809, main_#t~post5=|v_main_#t~post5_166|, main_~x~0=v_main_~x~0_1097, main_#t~post6=|v_main_#t~post6_349|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19114#(<= main_~x~0 750000)} is VALID [2022-04-15 06:55:22,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {19114#(<= main_~x~0 750000)} [215] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {19108#false} is VALID [2022-04-15 06:55:22,921 INFO L272 TraceCheckUtils]: 12: Hoare triple {19108#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {19108#false} is VALID [2022-04-15 06:55:22,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {19108#false} ~cond := #in~cond; {19108#false} is VALID [2022-04-15 06:55:22,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {19108#false} assume 0 == ~cond; {19108#false} is VALID [2022-04-15 06:55:22,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {19108#false} assume !false; {19108#false} is VALID [2022-04-15 06:55:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:22,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858365502] [2022-04-15 06:55:22,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858365502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:22,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046578323] [2022-04-15 06:55:22,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:22,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:22,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:22,924 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:55:22,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:55:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:22,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:55:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:22,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:23,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {19107#true} call ULTIMATE.init(); {19107#true} is VALID [2022-04-15 06:55:23,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {19107#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19107#true} is VALID [2022-04-15 06:55:23,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {19107#true} assume true; {19107#true} is VALID [2022-04-15 06:55:23,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19107#true} {19107#true} #48#return; {19107#true} is VALID [2022-04-15 06:55:23,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {19107#true} call #t~ret7 := main(); {19107#true} is VALID [2022-04-15 06:55:23,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {19107#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19112#(= main_~x~0 0)} is VALID [2022-04-15 06:55:23,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {19112#(= main_~x~0 0)} [216] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_198| |v_main_#t~post4_197|))) (or (and (< v_main_~x~0_1094 v_main_~x~0_1093) (< v_main_~x~0_1093 500001)) (and (not (< v_main_~x~0_1094 500000)) (= v_main_~x~0_1093 v_main_~x~0_1094) .cse0) (and .cse0 (= v_main_~x~0_1094 v_main_~x~0_1093)))) InVars {main_~x~0=v_main_~x~0_1094, main_#t~post4=|v_main_#t~post4_198|} OutVars{main_~x~0=v_main_~x~0_1093, main_#t~post4=|v_main_#t~post4_197|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:55:23,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [217] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:55:23,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [218] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1096)) (.cse1 (= v_main_~y~0_808 v_main_~y~0_807)) (.cse2 (= v_main_~x~0_1096 v_main_~x~0_1095)) (.cse3 (= |v_main_#t~post6_350| |v_main_#t~post6_348|))) (or (and (< v_main_~y~0_808 v_main_~y~0_807) .cse0 (< v_main_~y~0_807 (+ (div (+ (* (- 1) v_main_~x~0_1096) 999999) 2) v_main_~y~0_808 2)) (= (+ v_main_~x~0_1096 (* v_main_~y~0_807 2)) (+ v_main_~x~0_1095 (* v_main_~y~0_808 2)))) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1096 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_808, main_~x~0=v_main_~x~0_1096, main_#t~post6=|v_main_#t~post6_350|} OutVars{main_~y~0=v_main_~y~0_807, main_~x~0=v_main_~x~0_1095, main_#t~post6=|v_main_#t~post6_348|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:55:23,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [219] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:55:23,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {19137#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [220] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1098)) (.cse2 (= |v_main_#t~post6_353| |v_main_#t~post6_349|)) (.cse3 (= v_main_~y~0_810 v_main_~y~0_809)) (.cse4 (= |v_main_#t~post5_167| |v_main_#t~post5_166|)) (.cse5 (= v_main_~x~0_1098 v_main_~x~0_1097))) (or (let ((.cse0 (+ v_main_~x~0_1098 v_main_~y~0_809))) (and (< .cse0 (+ 750001 v_main_~y~0_810)) (< v_main_~y~0_810 v_main_~y~0_809) (= .cse0 (+ v_main_~x~0_1097 v_main_~y~0_810)) .cse1)) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1098 750000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_810, main_#t~post5=|v_main_#t~post5_167|, main_~x~0=v_main_~x~0_1098, main_#t~post6=|v_main_#t~post6_353|} OutVars{main_~y~0=v_main_~y~0_809, main_#t~post5=|v_main_#t~post5_166|, main_~x~0=v_main_~x~0_1097, main_#t~post6=|v_main_#t~post6_349|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19150#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:55:23,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {19150#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [215] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {19108#false} is VALID [2022-04-15 06:55:23,183 INFO L272 TraceCheckUtils]: 12: Hoare triple {19108#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {19108#false} is VALID [2022-04-15 06:55:23,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {19108#false} ~cond := #in~cond; {19108#false} is VALID [2022-04-15 06:55:23,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {19108#false} assume 0 == ~cond; {19108#false} is VALID [2022-04-15 06:55:23,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {19108#false} assume !false; {19108#false} is VALID [2022-04-15 06:55:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:23,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:23,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {19108#false} assume !false; {19108#false} is VALID [2022-04-15 06:55:23,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {19169#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19108#false} is VALID [2022-04-15 06:55:23,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {19173#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19169#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:23,797 INFO L272 TraceCheckUtils]: 12: Hoare triple {19177#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {19173#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:23,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {19181#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [215] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {19177#(= main_~x~0 1000000)} is VALID [2022-04-15 06:55:23,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {19181#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [220] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1098)) (.cse2 (= |v_main_#t~post6_353| |v_main_#t~post6_349|)) (.cse3 (= v_main_~y~0_810 v_main_~y~0_809)) (.cse4 (= |v_main_#t~post5_167| |v_main_#t~post5_166|)) (.cse5 (= v_main_~x~0_1098 v_main_~x~0_1097))) (or (let ((.cse0 (+ v_main_~x~0_1098 v_main_~y~0_809))) (and (< .cse0 (+ 750001 v_main_~y~0_810)) (< v_main_~y~0_810 v_main_~y~0_809) (= .cse0 (+ v_main_~x~0_1097 v_main_~y~0_810)) .cse1)) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1098 750000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_810, main_#t~post5=|v_main_#t~post5_167|, main_~x~0=v_main_~x~0_1098, main_#t~post6=|v_main_#t~post6_353|} OutVars{main_~y~0=v_main_~y~0_809, main_#t~post5=|v_main_#t~post5_166|, main_~x~0=v_main_~x~0_1097, main_#t~post6=|v_main_#t~post6_349|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19181#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:23,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {19181#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [219] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19181#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:23,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {19191#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [218] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1096)) (.cse1 (= v_main_~y~0_808 v_main_~y~0_807)) (.cse2 (= v_main_~x~0_1096 v_main_~x~0_1095)) (.cse3 (= |v_main_#t~post6_350| |v_main_#t~post6_348|))) (or (and (< v_main_~y~0_808 v_main_~y~0_807) .cse0 (< v_main_~y~0_807 (+ (div (+ (* (- 1) v_main_~x~0_1096) 999999) 2) v_main_~y~0_808 2)) (= (+ v_main_~x~0_1096 (* v_main_~y~0_807 2)) (+ v_main_~x~0_1095 (* v_main_~y~0_808 2)))) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1096 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_808, main_~x~0=v_main_~x~0_1096, main_#t~post6=|v_main_#t~post6_350|} OutVars{main_~y~0=v_main_~y~0_807, main_~x~0=v_main_~x~0_1095, main_#t~post6=|v_main_#t~post6_348|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {19181#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:23,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {19191#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [217] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19191#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:55:23,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {19191#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [216] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_198| |v_main_#t~post4_197|))) (or (and (< v_main_~x~0_1094 v_main_~x~0_1093) (< v_main_~x~0_1093 500001)) (and (not (< v_main_~x~0_1094 500000)) (= v_main_~x~0_1093 v_main_~x~0_1094) .cse0) (and .cse0 (= v_main_~x~0_1094 v_main_~x~0_1093)))) InVars {main_~x~0=v_main_~x~0_1094, main_#t~post4=|v_main_#t~post4_198|} OutVars{main_~x~0=v_main_~x~0_1093, main_#t~post4=|v_main_#t~post4_197|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19191#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:55:23,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {19107#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19191#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:55:23,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {19107#true} call #t~ret7 := main(); {19107#true} is VALID [2022-04-15 06:55:23,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19107#true} {19107#true} #48#return; {19107#true} is VALID [2022-04-15 06:55:23,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {19107#true} assume true; {19107#true} is VALID [2022-04-15 06:55:23,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {19107#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {19107#true} is VALID [2022-04-15 06:55:23,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {19107#true} call ULTIMATE.init(); {19107#true} is VALID [2022-04-15 06:55:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:23,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046578323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:23,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:23,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:55:24,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:24,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [593056118] [2022-04-15 06:55:24,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [593056118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:24,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:24,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 06:55:24,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035884782] [2022-04-15 06:55:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 06:55:24,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:24,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:24,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:24,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 06:55:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 06:55:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:55:24,957 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:32,176 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-04-15 06:55:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:55:32,176 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 129 [2022-04-15 06:55:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 148 transitions. [2022-04-15 06:55:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 148 transitions. [2022-04-15 06:55:32,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 148 transitions. [2022-04-15 06:55:32,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:32,296 INFO L225 Difference]: With dead ends: 159 [2022-04-15 06:55:32,296 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 06:55:32,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=487, Invalid=4915, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:55:32,297 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 98 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3724 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:32,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 192 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3724 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 06:55:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 06:55:33,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2022-04-15 06:55:33,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:33,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:33,802 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:33,802 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:33,803 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-04-15 06:55:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-04-15 06:55:33,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:33,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:33,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 06:55:33,804 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 141 states. [2022-04-15 06:55:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:33,805 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2022-04-15 06:55:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2022-04-15 06:55:33,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:33,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:33,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:33,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2022-04-15 06:55:33,807 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 129 [2022-04-15 06:55:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:33,807 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2022-04-15 06:55:33,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.676470588235294) internal successors, (125), 33 states have internal predecessors, (125), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:33,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 140 transitions. [2022-04-15 06:55:34,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2022-04-15 06:55:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 06:55:34,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:34,081 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:34,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 06:55:34,281 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:34,281 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -98672005, now seen corresponding path program 28 times [2022-04-15 06:55:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:34,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [89616675] [2022-04-15 06:55:34,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:34,594 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:34,815 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:34,816 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1210839463, now seen corresponding path program 1 times [2022-04-15 06:55:34,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:34,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283696823] [2022-04-15 06:55:34,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:34,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:34,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {20190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20182#true} is VALID [2022-04-15 06:55:34,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {20182#true} assume true; {20182#true} is VALID [2022-04-15 06:55:34,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20182#true} {20182#true} #48#return; {20182#true} is VALID [2022-04-15 06:55:34,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {20182#true} call ULTIMATE.init(); {20190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:34,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {20190#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20182#true} is VALID [2022-04-15 06:55:34,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {20182#true} assume true; {20182#true} is VALID [2022-04-15 06:55:34,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20182#true} {20182#true} #48#return; {20182#true} is VALID [2022-04-15 06:55:34,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {20182#true} call #t~ret7 := main(); {20182#true} is VALID [2022-04-15 06:55:34,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {20182#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {20187#(= main_~x~0 0)} is VALID [2022-04-15 06:55:34,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {20187#(= main_~x~0 0)} [222] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_205| |v_main_#t~post4_204|)) (.cse1 (= v_main_~x~0_1148 v_main_~x~0_1147))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1148 500000)) .cse1) (and (< v_main_~x~0_1147 500001) (< v_main_~x~0_1148 v_main_~x~0_1147)))) InVars {main_~x~0=v_main_~x~0_1148, main_#t~post4=|v_main_#t~post4_205|} OutVars{main_~x~0=v_main_~x~0_1147, main_#t~post4=|v_main_#t~post4_204|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {20188#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:34,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {20188#(<= main_~x~0 500000)} [223] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20188#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:34,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {20188#(<= main_~x~0 500000)} [224] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1150)) (.cse1 (= |v_main_#t~post6_363| |v_main_#t~post6_361|)) (.cse2 (= v_main_~y~0_852 v_main_~y~0_851)) (.cse3 (= v_main_~x~0_1150 v_main_~x~0_1149))) (or (and (< v_main_~y~0_851 (+ v_main_~y~0_852 2 (div (+ 999999 (* (- 1) v_main_~x~0_1150)) 2))) (< v_main_~y~0_852 v_main_~y~0_851) (= (+ (* v_main_~y~0_852 2) v_main_~x~0_1149) (+ v_main_~x~0_1150 (* v_main_~y~0_851 2))) .cse0) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1150 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_852, main_~x~0=v_main_~x~0_1150, main_#t~post6=|v_main_#t~post6_363|} OutVars{main_~y~0=v_main_~y~0_851, main_~x~0=v_main_~x~0_1149, main_#t~post6=|v_main_#t~post6_361|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {20189#(<= main_~x~0 999999)} is VALID [2022-04-15 06:55:34,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {20189#(<= main_~x~0 999999)} [225] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20189#(<= main_~x~0 999999)} is VALID [2022-04-15 06:55:34,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {20189#(<= main_~x~0 999999)} [226] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1152)) (.cse1 (= v_main_~x~0_1152 v_main_~x~0_1151)) (.cse2 (= v_main_~y~0_854 v_main_~y~0_853)) (.cse3 (= |v_main_#t~post5_173| |v_main_#t~post5_172|)) (.cse4 (= |v_main_#t~post6_366| |v_main_#t~post6_362|))) (or (and (< v_main_~x~0_1151 750001) (= (+ v_main_~x~0_1151 v_main_~y~0_854) (+ v_main_~x~0_1152 v_main_~y~0_853)) .cse0 (< v_main_~x~0_1152 v_main_~x~0_1151)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_1152 750000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_854, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_1152, main_#t~post6=|v_main_#t~post6_366|} OutVars{main_~y~0=v_main_~y~0_853, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1151, main_#t~post6=|v_main_#t~post6_362|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20189#(<= main_~x~0 999999)} is VALID [2022-04-15 06:55:34,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {20189#(<= main_~x~0 999999)} [221] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {20183#false} is VALID [2022-04-15 06:55:34,867 INFO L272 TraceCheckUtils]: 12: Hoare triple {20183#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {20183#false} is VALID [2022-04-15 06:55:34,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {20183#false} ~cond := #in~cond; {20183#false} is VALID [2022-04-15 06:55:34,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {20183#false} assume 0 == ~cond; {20183#false} is VALID [2022-04-15 06:55:34,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {20183#false} assume !false; {20183#false} is VALID [2022-04-15 06:55:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:55:34,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:34,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283696823] [2022-04-15 06:55:34,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283696823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:34,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208692109] [2022-04-15 06:55:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:34,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:34,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:34,868 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:55:34,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:55:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:34,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:55:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:34,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:35,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {20182#true} call ULTIMATE.init(); {20182#true} is VALID [2022-04-15 06:55:35,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {20182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20182#true} is VALID [2022-04-15 06:55:35,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {20182#true} assume true; {20182#true} is VALID [2022-04-15 06:55:35,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20182#true} {20182#true} #48#return; {20182#true} is VALID [2022-04-15 06:55:35,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {20182#true} call #t~ret7 := main(); {20182#true} is VALID [2022-04-15 06:55:35,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {20182#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {20209#(<= main_~x~0 0)} is VALID [2022-04-15 06:55:35,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {20209#(<= main_~x~0 0)} [222] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_205| |v_main_#t~post4_204|)) (.cse1 (= v_main_~x~0_1148 v_main_~x~0_1147))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1148 500000)) .cse1) (and (< v_main_~x~0_1147 500001) (< v_main_~x~0_1148 v_main_~x~0_1147)))) InVars {main_~x~0=v_main_~x~0_1148, main_#t~post4=|v_main_#t~post4_205|} OutVars{main_~x~0=v_main_~x~0_1147, main_#t~post4=|v_main_#t~post4_204|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {20188#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:35,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {20188#(<= main_~x~0 500000)} [223] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20188#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:35,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {20188#(<= main_~x~0 500000)} [224] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1150)) (.cse1 (= |v_main_#t~post6_363| |v_main_#t~post6_361|)) (.cse2 (= v_main_~y~0_852 v_main_~y~0_851)) (.cse3 (= v_main_~x~0_1150 v_main_~x~0_1149))) (or (and (< v_main_~y~0_851 (+ v_main_~y~0_852 2 (div (+ 999999 (* (- 1) v_main_~x~0_1150)) 2))) (< v_main_~y~0_852 v_main_~y~0_851) (= (+ (* v_main_~y~0_852 2) v_main_~x~0_1149) (+ v_main_~x~0_1150 (* v_main_~y~0_851 2))) .cse0) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1150 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_852, main_~x~0=v_main_~x~0_1150, main_#t~post6=|v_main_#t~post6_363|} OutVars{main_~y~0=v_main_~y~0_851, main_~x~0=v_main_~x~0_1149, main_#t~post6=|v_main_#t~post6_361|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {20188#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:35,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {20188#(<= main_~x~0 500000)} [225] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20188#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:35,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {20188#(<= main_~x~0 500000)} [226] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1152)) (.cse1 (= v_main_~x~0_1152 v_main_~x~0_1151)) (.cse2 (= v_main_~y~0_854 v_main_~y~0_853)) (.cse3 (= |v_main_#t~post5_173| |v_main_#t~post5_172|)) (.cse4 (= |v_main_#t~post6_366| |v_main_#t~post6_362|))) (or (and (< v_main_~x~0_1151 750001) (= (+ v_main_~x~0_1151 v_main_~y~0_854) (+ v_main_~x~0_1152 v_main_~y~0_853)) .cse0 (< v_main_~x~0_1152 v_main_~x~0_1151)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_1152 750000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_854, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_1152, main_#t~post6=|v_main_#t~post6_366|} OutVars{main_~y~0=v_main_~y~0_853, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1151, main_#t~post6=|v_main_#t~post6_362|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20225#(< main_~x~0 750001)} is VALID [2022-04-15 06:55:35,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {20225#(< main_~x~0 750001)} [221] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {20183#false} is VALID [2022-04-15 06:55:35,046 INFO L272 TraceCheckUtils]: 12: Hoare triple {20183#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {20183#false} is VALID [2022-04-15 06:55:35,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {20183#false} ~cond := #in~cond; {20183#false} is VALID [2022-04-15 06:55:35,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {20183#false} assume 0 == ~cond; {20183#false} is VALID [2022-04-15 06:55:35,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {20183#false} assume !false; {20183#false} is VALID [2022-04-15 06:55:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:35,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:35,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {20183#false} assume !false; {20183#false} is VALID [2022-04-15 06:55:35,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {20244#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20183#false} is VALID [2022-04-15 06:55:35,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {20248#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20244#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:35,429 INFO L272 TraceCheckUtils]: 12: Hoare triple {20252#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {20248#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:35,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {20256#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [221] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {20252#(= main_~x~0 1000000)} is VALID [2022-04-15 06:55:35,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {20256#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [226] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1152)) (.cse1 (= v_main_~x~0_1152 v_main_~x~0_1151)) (.cse2 (= v_main_~y~0_854 v_main_~y~0_853)) (.cse3 (= |v_main_#t~post5_173| |v_main_#t~post5_172|)) (.cse4 (= |v_main_#t~post6_366| |v_main_#t~post6_362|))) (or (and (< v_main_~x~0_1151 750001) (= (+ v_main_~x~0_1151 v_main_~y~0_854) (+ v_main_~x~0_1152 v_main_~y~0_853)) .cse0 (< v_main_~x~0_1152 v_main_~x~0_1151)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_1152 750000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_854, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_1152, main_#t~post6=|v_main_#t~post6_366|} OutVars{main_~y~0=v_main_~y~0_853, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1151, main_#t~post6=|v_main_#t~post6_362|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20256#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:35,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {20256#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [225] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20256#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:35,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {20266#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [224] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1150)) (.cse1 (= |v_main_#t~post6_363| |v_main_#t~post6_361|)) (.cse2 (= v_main_~y~0_852 v_main_~y~0_851)) (.cse3 (= v_main_~x~0_1150 v_main_~x~0_1149))) (or (and (< v_main_~y~0_851 (+ v_main_~y~0_852 2 (div (+ 999999 (* (- 1) v_main_~x~0_1150)) 2))) (< v_main_~y~0_852 v_main_~y~0_851) (= (+ (* v_main_~y~0_852 2) v_main_~x~0_1149) (+ v_main_~x~0_1150 (* v_main_~y~0_851 2))) .cse0) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1150 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_852, main_~x~0=v_main_~x~0_1150, main_#t~post6=|v_main_#t~post6_363|} OutVars{main_~y~0=v_main_~y~0_851, main_~x~0=v_main_~x~0_1149, main_#t~post6=|v_main_#t~post6_361|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {20256#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:35,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {20266#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [223] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20266#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:55:35,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {20266#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [222] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_205| |v_main_#t~post4_204|)) (.cse1 (= v_main_~x~0_1148 v_main_~x~0_1147))) (or (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1148 500000)) .cse1) (and (< v_main_~x~0_1147 500001) (< v_main_~x~0_1148 v_main_~x~0_1147)))) InVars {main_~x~0=v_main_~x~0_1148, main_#t~post4=|v_main_#t~post4_205|} OutVars{main_~x~0=v_main_~x~0_1147, main_#t~post4=|v_main_#t~post4_204|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {20266#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:55:35,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {20182#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {20266#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:55:35,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {20182#true} call #t~ret7 := main(); {20182#true} is VALID [2022-04-15 06:55:35,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20182#true} {20182#true} #48#return; {20182#true} is VALID [2022-04-15 06:55:35,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {20182#true} assume true; {20182#true} is VALID [2022-04-15 06:55:35,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {20182#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {20182#true} is VALID [2022-04-15 06:55:35,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {20182#true} call ULTIMATE.init(); {20182#true} is VALID [2022-04-15 06:55:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:35,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208692109] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:35,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:35,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:55:36,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:36,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [89616675] [2022-04-15 06:55:36,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [89616675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:36,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:36,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:55:36,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767153334] [2022-04-15 06:55:36,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 06:55:36,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:36,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:36,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:36,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:55:36,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:36,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:55:36,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1736, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:55:36,633 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:43,868 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2022-04-15 06:55:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:55:43,868 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-15 06:55:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 152 transitions. [2022-04-15 06:55:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 152 transitions. [2022-04-15 06:55:43,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 152 transitions. [2022-04-15 06:55:43,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:43,990 INFO L225 Difference]: With dead ends: 163 [2022-04-15 06:55:43,991 INFO L226 Difference]: Without dead ends: 145 [2022-04-15 06:55:43,991 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=509, Invalid=5343, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 06:55:43,992 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 102 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:43,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 193 Invalid, 3885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 3850 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 06:55:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-15 06:55:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2022-04-15 06:55:45,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:45,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:45,627 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:45,627 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:45,629 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-04-15 06:55:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2022-04-15 06:55:45,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:45,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:45,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-15 06:55:45,630 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-15 06:55:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:45,631 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2022-04-15 06:55:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2022-04-15 06:55:45,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:45,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:45,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:45,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-15 06:55:45,634 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 133 [2022-04-15 06:55:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:45,634 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-15 06:55:45,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.6857142857142855) internal successors, (129), 34 states have internal predecessors, (129), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:45,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-15 06:55:45,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-15 06:55:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 06:55:45,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:45,910 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:45,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:55:46,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:46,123 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:46,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash -736721838, now seen corresponding path program 29 times [2022-04-15 06:55:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:46,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1987011412] [2022-04-15 06:55:48,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:48,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:48,750 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:48,751 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash 851264487, now seen corresponding path program 1 times [2022-04-15 06:55:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:48,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397940401] [2022-04-15 06:55:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:48,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:48,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {21293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21285#true} is VALID [2022-04-15 06:55:48,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {21285#true} assume true; {21285#true} is VALID [2022-04-15 06:55:48,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21285#true} {21285#true} #48#return; {21285#true} is VALID [2022-04-15 06:55:48,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {21285#true} call ULTIMATE.init(); {21293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:48,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {21293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21285#true} is VALID [2022-04-15 06:55:48,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {21285#true} assume true; {21285#true} is VALID [2022-04-15 06:55:48,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21285#true} {21285#true} #48#return; {21285#true} is VALID [2022-04-15 06:55:48,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {21285#true} call #t~ret7 := main(); {21285#true} is VALID [2022-04-15 06:55:48,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {21285#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21290#(= main_~x~0 0)} is VALID [2022-04-15 06:55:48,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {21290#(= main_~x~0 0)} [228] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_212| |v_main_#t~post4_211|)) (.cse1 (= v_main_~x~0_1203 v_main_~x~0_1202))) (or (and (<= 500000 v_main_~x~0_1203) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1203 v_main_~x~0_1202) (< v_main_~x~0_1202 500001)))) InVars {main_~x~0=v_main_~x~0_1203, main_#t~post4=|v_main_#t~post4_212|} OutVars{main_~x~0=v_main_~x~0_1202, main_#t~post4=|v_main_#t~post4_211|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21291#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:48,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {21291#(<= main_~x~0 500000)} [229] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21291#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:48,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {21291#(<= main_~x~0 500000)} [230] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_897 v_main_~y~0_896)) (.cse2 (= v_main_~x~0_1205 v_main_~x~0_1204)) (.cse3 (= |v_main_#t~post6_376| |v_main_#t~post6_374|)) (.cse0 (<= 750000 v_main_~x~0_1205))) (or (and (< v_main_~y~0_897 v_main_~y~0_896) .cse0 (= (+ (* v_main_~y~0_896 2) v_main_~x~0_1205) (+ v_main_~x~0_1204 (* v_main_~y~0_897 2))) (< v_main_~y~0_896 (+ (div (+ (* (- 1) v_main_~x~0_1205) 999999) 2) v_main_~y~0_897 2))) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1205 1000000)))))) InVars {main_~y~0=v_main_~y~0_897, main_~x~0=v_main_~x~0_1205, main_#t~post6=|v_main_#t~post6_376|} OutVars{main_~y~0=v_main_~y~0_896, main_~x~0=v_main_~x~0_1204, main_#t~post6=|v_main_#t~post6_374|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {21292#(<= main_~x~0 999999)} is VALID [2022-04-15 06:55:48,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {21292#(<= main_~x~0 999999)} [231] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21292#(<= main_~x~0 999999)} is VALID [2022-04-15 06:55:48,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {21292#(<= main_~x~0 999999)} [232] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse1 (= |v_main_#t~post6_379| |v_main_#t~post6_375|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_899 v_main_~y~0_898)) (.cse4 (<= 500000 v_main_~x~0_1207))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1207 750000)))) (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1207 v_main_~y~0_898) (+ v_main_~x~0_1206 v_main_~y~0_899)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse4 (< v_main_~x~0_1206 750001)))) InVars {main_~y~0=v_main_~y~0_899, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1207, main_#t~post6=|v_main_#t~post6_379|} OutVars{main_~y~0=v_main_~y~0_898, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1206, main_#t~post6=|v_main_#t~post6_375|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21292#(<= main_~x~0 999999)} is VALID [2022-04-15 06:55:48,811 INFO L290 TraceCheckUtils]: 11: Hoare triple {21292#(<= main_~x~0 999999)} [227] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {21286#false} is VALID [2022-04-15 06:55:48,811 INFO L272 TraceCheckUtils]: 12: Hoare triple {21286#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {21286#false} is VALID [2022-04-15 06:55:48,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {21286#false} ~cond := #in~cond; {21286#false} is VALID [2022-04-15 06:55:48,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {21286#false} assume 0 == ~cond; {21286#false} is VALID [2022-04-15 06:55:48,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {21286#false} assume !false; {21286#false} is VALID [2022-04-15 06:55:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:55:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:48,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397940401] [2022-04-15 06:55:48,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397940401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:48,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209557660] [2022-04-15 06:55:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:48,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:48,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:48,815 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:55:48,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 06:55:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:48,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:55:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:48,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:49,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {21285#true} call ULTIMATE.init(); {21285#true} is VALID [2022-04-15 06:55:49,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {21285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21285#true} is VALID [2022-04-15 06:55:49,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {21285#true} assume true; {21285#true} is VALID [2022-04-15 06:55:49,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21285#true} {21285#true} #48#return; {21285#true} is VALID [2022-04-15 06:55:49,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {21285#true} call #t~ret7 := main(); {21285#true} is VALID [2022-04-15 06:55:49,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {21285#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21312#(<= main_~x~0 0)} is VALID [2022-04-15 06:55:49,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {21312#(<= main_~x~0 0)} [228] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_212| |v_main_#t~post4_211|)) (.cse1 (= v_main_~x~0_1203 v_main_~x~0_1202))) (or (and (<= 500000 v_main_~x~0_1203) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1203 v_main_~x~0_1202) (< v_main_~x~0_1202 500001)))) InVars {main_~x~0=v_main_~x~0_1203, main_#t~post4=|v_main_#t~post4_212|} OutVars{main_~x~0=v_main_~x~0_1202, main_#t~post4=|v_main_#t~post4_211|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21291#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:49,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {21291#(<= main_~x~0 500000)} [229] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21291#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {21291#(<= main_~x~0 500000)} [230] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_897 v_main_~y~0_896)) (.cse2 (= v_main_~x~0_1205 v_main_~x~0_1204)) (.cse3 (= |v_main_#t~post6_376| |v_main_#t~post6_374|)) (.cse0 (<= 750000 v_main_~x~0_1205))) (or (and (< v_main_~y~0_897 v_main_~y~0_896) .cse0 (= (+ (* v_main_~y~0_896 2) v_main_~x~0_1205) (+ v_main_~x~0_1204 (* v_main_~y~0_897 2))) (< v_main_~y~0_896 (+ (div (+ (* (- 1) v_main_~x~0_1205) 999999) 2) v_main_~y~0_897 2))) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1205 1000000)))))) InVars {main_~y~0=v_main_~y~0_897, main_~x~0=v_main_~x~0_1205, main_#t~post6=|v_main_#t~post6_376|} OutVars{main_~y~0=v_main_~y~0_896, main_~x~0=v_main_~x~0_1204, main_#t~post6=|v_main_#t~post6_374|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {21291#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:49,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {21291#(<= main_~x~0 500000)} [231] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21291#(<= main_~x~0 500000)} is VALID [2022-04-15 06:55:49,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {21291#(<= main_~x~0 500000)} [232] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse1 (= |v_main_#t~post6_379| |v_main_#t~post6_375|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_899 v_main_~y~0_898)) (.cse4 (<= 500000 v_main_~x~0_1207))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1207 750000)))) (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1207 v_main_~y~0_898) (+ v_main_~x~0_1206 v_main_~y~0_899)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse4 (< v_main_~x~0_1206 750001)))) InVars {main_~y~0=v_main_~y~0_899, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1207, main_#t~post6=|v_main_#t~post6_379|} OutVars{main_~y~0=v_main_~y~0_898, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1206, main_#t~post6=|v_main_#t~post6_375|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21328#(< main_~x~0 750001)} is VALID [2022-04-15 06:55:49,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {21328#(< main_~x~0 750001)} [227] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {21286#false} is VALID [2022-04-15 06:55:49,008 INFO L272 TraceCheckUtils]: 12: Hoare triple {21286#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {21286#false} is VALID [2022-04-15 06:55:49,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {21286#false} ~cond := #in~cond; {21286#false} is VALID [2022-04-15 06:55:49,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {21286#false} assume 0 == ~cond; {21286#false} is VALID [2022-04-15 06:55:49,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {21286#false} assume !false; {21286#false} is VALID [2022-04-15 06:55:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:49,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:49,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {21286#false} assume !false; {21286#false} is VALID [2022-04-15 06:55:49,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {21347#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21286#false} is VALID [2022-04-15 06:55:49,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {21351#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21347#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:55:49,396 INFO L272 TraceCheckUtils]: 12: Hoare triple {21355#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {21351#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:55:49,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {21359#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [227] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {21355#(= main_~x~0 1000000)} is VALID [2022-04-15 06:55:49,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {21359#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [232] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1207 v_main_~x~0_1206)) (.cse1 (= |v_main_#t~post6_379| |v_main_#t~post6_375|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_899 v_main_~y~0_898)) (.cse4 (<= 500000 v_main_~x~0_1207))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1207 750000)))) (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1207 v_main_~y~0_898) (+ v_main_~x~0_1206 v_main_~y~0_899)) (< v_main_~x~0_1207 v_main_~x~0_1206) .cse4 (< v_main_~x~0_1206 750001)))) InVars {main_~y~0=v_main_~y~0_899, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1207, main_#t~post6=|v_main_#t~post6_379|} OutVars{main_~y~0=v_main_~y~0_898, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1206, main_#t~post6=|v_main_#t~post6_375|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21359#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:49,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {21359#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [231] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21359#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:49,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {21369#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [230] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~y~0_897 v_main_~y~0_896)) (.cse2 (= v_main_~x~0_1205 v_main_~x~0_1204)) (.cse3 (= |v_main_#t~post6_376| |v_main_#t~post6_374|)) (.cse0 (<= 750000 v_main_~x~0_1205))) (or (and (< v_main_~y~0_897 v_main_~y~0_896) .cse0 (= (+ (* v_main_~y~0_896 2) v_main_~x~0_1205) (+ v_main_~x~0_1204 (* v_main_~y~0_897 2))) (< v_main_~y~0_896 (+ (div (+ (* (- 1) v_main_~x~0_1205) 999999) 2) v_main_~y~0_897 2))) (and .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1205 1000000)))))) InVars {main_~y~0=v_main_~y~0_897, main_~x~0=v_main_~x~0_1205, main_#t~post6=|v_main_#t~post6_376|} OutVars{main_~y~0=v_main_~y~0_896, main_~x~0=v_main_~x~0_1204, main_#t~post6=|v_main_#t~post6_374|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {21359#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:55:49,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {21369#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [229] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21369#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:55:49,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {21369#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [228] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_212| |v_main_#t~post4_211|)) (.cse1 (= v_main_~x~0_1203 v_main_~x~0_1202))) (or (and (<= 500000 v_main_~x~0_1203) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1203 v_main_~x~0_1202) (< v_main_~x~0_1202 500001)))) InVars {main_~x~0=v_main_~x~0_1203, main_#t~post4=|v_main_#t~post4_212|} OutVars{main_~x~0=v_main_~x~0_1202, main_#t~post4=|v_main_#t~post4_211|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21369#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:55:49,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {21285#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21369#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:55:49,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {21285#true} call #t~ret7 := main(); {21285#true} is VALID [2022-04-15 06:55:49,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21285#true} {21285#true} #48#return; {21285#true} is VALID [2022-04-15 06:55:49,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {21285#true} assume true; {21285#true} is VALID [2022-04-15 06:55:49,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {21285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {21285#true} is VALID [2022-04-15 06:55:49,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {21285#true} call ULTIMATE.init(); {21285#true} is VALID [2022-04-15 06:55:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:49,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209557660] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:49,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:49,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:55:50,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1987011412] [2022-04-15 06:55:50,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1987011412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:50,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:50,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 06:55:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079893121] [2022-04-15 06:55:50,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:50,615 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 06:55:50,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:50,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:50,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:50,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 06:55:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 06:55:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1820, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:55:50,718 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:58,857 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2022-04-15 06:55:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:55:58,857 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-04-15 06:55:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 156 transitions. [2022-04-15 06:55:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:55:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 156 transitions. [2022-04-15 06:55:58,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 156 transitions. [2022-04-15 06:55:58,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:58,978 INFO L225 Difference]: With dead ends: 167 [2022-04-15 06:55:58,978 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 06:55:58,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=5639, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:55:58,979 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 104 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4228 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 4264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:58,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 204 Invalid, 4264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4228 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 06:55:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 06:56:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2022-04-15 06:56:00,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:00,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:00,713 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:00,713 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:00,715 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2022-04-15 06:56:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-15 06:56:00,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:00,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:00,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 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 149 states. [2022-04-15 06:56:00,716 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 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 149 states. [2022-04-15 06:56:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:00,718 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2022-04-15 06:56:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-15 06:56:00,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:00,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:00,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:00,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2022-04-15 06:56:00,720 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 137 [2022-04-15 06:56:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:00,721 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2022-04-15 06:56:00,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.6944444444444446) internal successors, (133), 35 states have internal predecessors, (133), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:00,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 148 transitions. [2022-04-15 06:56:01,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 06:56:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-15 06:56:01,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:01,017 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:01,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 06:56:01,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-15 06:56:01,218 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:01,219 INFO L85 PathProgramCache]: Analyzing trace with hash -823401815, now seen corresponding path program 30 times [2022-04-15 06:56:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:01,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341085723] [2022-04-15 06:56:01,315 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:02,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:02,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:02,358 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash 491689511, now seen corresponding path program 1 times [2022-04-15 06:56:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:02,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933715447] [2022-04-15 06:56:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:02,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:02,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {22423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22415#true} is VALID [2022-04-15 06:56:02,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {22415#true} assume true; {22415#true} is VALID [2022-04-15 06:56:02,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22415#true} {22415#true} #48#return; {22415#true} is VALID [2022-04-15 06:56:02,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {22415#true} call ULTIMATE.init(); {22423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:02,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {22423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22415#true} is VALID [2022-04-15 06:56:02,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {22415#true} assume true; {22415#true} is VALID [2022-04-15 06:56:02,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22415#true} {22415#true} #48#return; {22415#true} is VALID [2022-04-15 06:56:02,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {22415#true} call #t~ret7 := main(); {22415#true} is VALID [2022-04-15 06:56:02,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {22415#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {22420#(= main_~x~0 0)} is VALID [2022-04-15 06:56:02,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {22420#(= main_~x~0 0)} [234] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1259 v_main_~x~0_1258)) (.cse1 (= |v_main_#t~post4_219| |v_main_#t~post4_218|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1259)) (and .cse0 .cse1) (and (< v_main_~x~0_1258 500001) (< v_main_~x~0_1259 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1259, main_#t~post4=|v_main_#t~post4_219|} OutVars{main_~x~0=v_main_~x~0_1258, main_#t~post4=|v_main_#t~post4_218|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22421#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:02,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {22421#(<= main_~x~0 500000)} [235] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22421#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:02,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {22421#(<= main_~x~0 500000)} [236] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_943 v_main_~y~0_942)) (.cse1 (= |v_main_#t~post6_389| |v_main_#t~post6_387|)) (.cse3 (= v_main_~x~0_1261 v_main_~x~0_1260)) (.cse2 (<= 750000 v_main_~x~0_1261))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1261 1000000)) (not .cse2)) .cse3) (and .cse0 .cse1 .cse3) (and (= (+ v_main_~x~0_1260 (* v_main_~y~0_943 2)) (+ v_main_~x~0_1261 (* v_main_~y~0_942 2))) (< v_main_~y~0_943 v_main_~y~0_942) (< v_main_~y~0_942 (+ v_main_~y~0_943 2 (div (+ 999999 (* (- 1) v_main_~x~0_1261)) 2))) .cse2))) InVars {main_~y~0=v_main_~y~0_943, main_~x~0=v_main_~x~0_1261, main_#t~post6=|v_main_#t~post6_389|} OutVars{main_~y~0=v_main_~y~0_942, main_~x~0=v_main_~x~0_1260, main_#t~post6=|v_main_#t~post6_387|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {22422#(<= main_~x~0 999999)} is VALID [2022-04-15 06:56:02,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {22422#(<= main_~x~0 999999)} [237] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22422#(<= main_~x~0 999999)} is VALID [2022-04-15 06:56:02,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {22422#(<= main_~x~0 999999)} [238] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1263)) (.cse1 (= v_main_~x~0_1263 v_main_~x~0_1262)) (.cse2 (= v_main_~y~0_945 v_main_~y~0_944)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= |v_main_#t~post6_392| |v_main_#t~post6_388|))) (or (and .cse0 (< v_main_~x~0_1263 v_main_~x~0_1262) (= (+ v_main_~x~0_1263 v_main_~y~0_944) (+ v_main_~x~0_1262 v_main_~y~0_945)) (< v_main_~x~0_1262 750001)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not .cse0) (not (< v_main_~x~0_1263 750000))) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_945, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1263, main_#t~post6=|v_main_#t~post6_392|} OutVars{main_~y~0=v_main_~y~0_944, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_1262, main_#t~post6=|v_main_#t~post6_388|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22422#(<= main_~x~0 999999)} is VALID [2022-04-15 06:56:02,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {22422#(<= main_~x~0 999999)} [233] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {22416#false} is VALID [2022-04-15 06:56:02,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {22416#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {22416#false} is VALID [2022-04-15 06:56:02,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {22416#false} ~cond := #in~cond; {22416#false} is VALID [2022-04-15 06:56:02,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {22416#false} assume 0 == ~cond; {22416#false} is VALID [2022-04-15 06:56:02,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {22416#false} assume !false; {22416#false} is VALID [2022-04-15 06:56:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:56:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933715447] [2022-04-15 06:56:02,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933715447] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418175668] [2022-04-15 06:56:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:02,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:02,420 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:02,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:56:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:02,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:56:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:02,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:02,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {22415#true} call ULTIMATE.init(); {22415#true} is VALID [2022-04-15 06:56:02,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {22415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22415#true} is VALID [2022-04-15 06:56:02,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {22415#true} assume true; {22415#true} is VALID [2022-04-15 06:56:02,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22415#true} {22415#true} #48#return; {22415#true} is VALID [2022-04-15 06:56:02,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {22415#true} call #t~ret7 := main(); {22415#true} is VALID [2022-04-15 06:56:02,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {22415#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {22442#(<= main_~x~0 0)} is VALID [2022-04-15 06:56:02,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {22442#(<= main_~x~0 0)} [234] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1259 v_main_~x~0_1258)) (.cse1 (= |v_main_#t~post4_219| |v_main_#t~post4_218|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1259)) (and .cse0 .cse1) (and (< v_main_~x~0_1258 500001) (< v_main_~x~0_1259 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1259, main_#t~post4=|v_main_#t~post4_219|} OutVars{main_~x~0=v_main_~x~0_1258, main_#t~post4=|v_main_#t~post4_218|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22421#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:02,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {22421#(<= main_~x~0 500000)} [235] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22421#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:02,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {22421#(<= main_~x~0 500000)} [236] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_943 v_main_~y~0_942)) (.cse1 (= |v_main_#t~post6_389| |v_main_#t~post6_387|)) (.cse3 (= v_main_~x~0_1261 v_main_~x~0_1260)) (.cse2 (<= 750000 v_main_~x~0_1261))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1261 1000000)) (not .cse2)) .cse3) (and .cse0 .cse1 .cse3) (and (= (+ v_main_~x~0_1260 (* v_main_~y~0_943 2)) (+ v_main_~x~0_1261 (* v_main_~y~0_942 2))) (< v_main_~y~0_943 v_main_~y~0_942) (< v_main_~y~0_942 (+ v_main_~y~0_943 2 (div (+ 999999 (* (- 1) v_main_~x~0_1261)) 2))) .cse2))) InVars {main_~y~0=v_main_~y~0_943, main_~x~0=v_main_~x~0_1261, main_#t~post6=|v_main_#t~post6_389|} OutVars{main_~y~0=v_main_~y~0_942, main_~x~0=v_main_~x~0_1260, main_#t~post6=|v_main_#t~post6_387|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {22421#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:02,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {22421#(<= main_~x~0 500000)} [237] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22421#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:02,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {22421#(<= main_~x~0 500000)} [238] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1263)) (.cse1 (= v_main_~x~0_1263 v_main_~x~0_1262)) (.cse2 (= v_main_~y~0_945 v_main_~y~0_944)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= |v_main_#t~post6_392| |v_main_#t~post6_388|))) (or (and .cse0 (< v_main_~x~0_1263 v_main_~x~0_1262) (= (+ v_main_~x~0_1263 v_main_~y~0_944) (+ v_main_~x~0_1262 v_main_~y~0_945)) (< v_main_~x~0_1262 750001)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not .cse0) (not (< v_main_~x~0_1263 750000))) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_945, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1263, main_#t~post6=|v_main_#t~post6_392|} OutVars{main_~y~0=v_main_~y~0_944, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_1262, main_#t~post6=|v_main_#t~post6_388|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22458#(< main_~x~0 750001)} is VALID [2022-04-15 06:56:02,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {22458#(< main_~x~0 750001)} [233] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {22416#false} is VALID [2022-04-15 06:56:02,601 INFO L272 TraceCheckUtils]: 12: Hoare triple {22416#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {22416#false} is VALID [2022-04-15 06:56:02,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {22416#false} ~cond := #in~cond; {22416#false} is VALID [2022-04-15 06:56:02,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {22416#false} assume 0 == ~cond; {22416#false} is VALID [2022-04-15 06:56:02,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {22416#false} assume !false; {22416#false} is VALID [2022-04-15 06:56:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:02,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:02,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {22416#false} assume !false; {22416#false} is VALID [2022-04-15 06:56:02,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {22477#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22416#false} is VALID [2022-04-15 06:56:02,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {22481#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22477#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:02,983 INFO L272 TraceCheckUtils]: 12: Hoare triple {22485#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {22481#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:02,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {22489#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [233] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {22485#(= main_~x~0 1000000)} is VALID [2022-04-15 06:56:02,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {22489#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [238] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1263)) (.cse1 (= v_main_~x~0_1263 v_main_~x~0_1262)) (.cse2 (= v_main_~y~0_945 v_main_~y~0_944)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= |v_main_#t~post6_392| |v_main_#t~post6_388|))) (or (and .cse0 (< v_main_~x~0_1263 v_main_~x~0_1262) (= (+ v_main_~x~0_1263 v_main_~y~0_944) (+ v_main_~x~0_1262 v_main_~y~0_945)) (< v_main_~x~0_1262 750001)) (and .cse1 .cse2 .cse3 .cse4) (and (or (not .cse0) (not (< v_main_~x~0_1263 750000))) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_945, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1263, main_#t~post6=|v_main_#t~post6_392|} OutVars{main_~y~0=v_main_~y~0_944, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_1262, main_#t~post6=|v_main_#t~post6_388|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22489#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:02,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {22489#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [237] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22489#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:02,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {22499#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [236] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_943 v_main_~y~0_942)) (.cse1 (= |v_main_#t~post6_389| |v_main_#t~post6_387|)) (.cse3 (= v_main_~x~0_1261 v_main_~x~0_1260)) (.cse2 (<= 750000 v_main_~x~0_1261))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1261 1000000)) (not .cse2)) .cse3) (and .cse0 .cse1 .cse3) (and (= (+ v_main_~x~0_1260 (* v_main_~y~0_943 2)) (+ v_main_~x~0_1261 (* v_main_~y~0_942 2))) (< v_main_~y~0_943 v_main_~y~0_942) (< v_main_~y~0_942 (+ v_main_~y~0_943 2 (div (+ 999999 (* (- 1) v_main_~x~0_1261)) 2))) .cse2))) InVars {main_~y~0=v_main_~y~0_943, main_~x~0=v_main_~x~0_1261, main_#t~post6=|v_main_#t~post6_389|} OutVars{main_~y~0=v_main_~y~0_942, main_~x~0=v_main_~x~0_1260, main_#t~post6=|v_main_#t~post6_387|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {22489#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:02,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {22499#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [235] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22499#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:56:02,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {22499#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [234] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1259 v_main_~x~0_1258)) (.cse1 (= |v_main_#t~post4_219| |v_main_#t~post4_218|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1259)) (and .cse0 .cse1) (and (< v_main_~x~0_1258 500001) (< v_main_~x~0_1259 v_main_~x~0_1258)))) InVars {main_~x~0=v_main_~x~0_1259, main_#t~post4=|v_main_#t~post4_219|} OutVars{main_~x~0=v_main_~x~0_1258, main_#t~post4=|v_main_#t~post4_218|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22499#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:56:02,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {22415#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {22499#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:56:02,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {22415#true} call #t~ret7 := main(); {22415#true} is VALID [2022-04-15 06:56:02,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22415#true} {22415#true} #48#return; {22415#true} is VALID [2022-04-15 06:56:02,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {22415#true} assume true; {22415#true} is VALID [2022-04-15 06:56:02,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {22415#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {22415#true} is VALID [2022-04-15 06:56:02,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {22415#true} call ULTIMATE.init(); {22415#true} is VALID [2022-04-15 06:56:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:02,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418175668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:02,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:02,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:56:04,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:04,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341085723] [2022-04-15 06:56:04,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341085723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:04,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:04,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 06:56:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960932341] [2022-04-15 06:56:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:04,166 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-15 06:56:04,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:04,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:04,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:04,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 06:56:04,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:04,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 06:56:04,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:56:04,260 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:12,652 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2022-04-15 06:56:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 06:56:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2022-04-15 06:56:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 160 transitions. [2022-04-15 06:56:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 160 transitions. [2022-04-15 06:56:12,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 160 transitions. [2022-04-15 06:56:12,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:12,778 INFO L225 Difference]: With dead ends: 171 [2022-04-15 06:56:12,778 INFO L226 Difference]: Without dead ends: 153 [2022-04-15 06:56:12,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=537, Invalid=5943, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:56:12,778 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 107 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4492 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 4529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:12,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 210 Invalid, 4529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4492 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 06:56:12,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-15 06:56:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-04-15 06:56:14,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:14,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:14,661 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:14,661 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:14,662 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2022-04-15 06:56:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2022-04-15 06:56:14,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:14,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:14,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 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 153 states. [2022-04-15 06:56:14,663 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 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 153 states. [2022-04-15 06:56:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:14,664 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2022-04-15 06:56:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2022-04-15 06:56:14,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:14,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:14,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:14,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2022-04-15 06:56:14,666 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 141 [2022-04-15 06:56:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:14,666 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2022-04-15 06:56:14,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.7027027027027026) internal successors, (137), 36 states have internal predecessors, (137), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:14,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 152 transitions. [2022-04-15 06:56:14,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2022-04-15 06:56:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 06:56:14,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:14,966 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:14,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-15 06:56:15,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:15,171 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2001977984, now seen corresponding path program 31 times [2022-04-15 06:56:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:15,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129092733] [2022-04-15 06:56:15,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:15,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:15,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:15,719 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash 132114535, now seen corresponding path program 1 times [2022-04-15 06:56:15,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:15,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240635655] [2022-04-15 06:56:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:15,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {23580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23572#true} is VALID [2022-04-15 06:56:15,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {23572#true} assume true; {23572#true} is VALID [2022-04-15 06:56:15,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23572#true} {23572#true} #48#return; {23572#true} is VALID [2022-04-15 06:56:15,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {23572#true} call ULTIMATE.init(); {23580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:15,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {23580#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23572#true} is VALID [2022-04-15 06:56:15,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {23572#true} assume true; {23572#true} is VALID [2022-04-15 06:56:15,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23572#true} {23572#true} #48#return; {23572#true} is VALID [2022-04-15 06:56:15,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {23572#true} call #t~ret7 := main(); {23572#true} is VALID [2022-04-15 06:56:15,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {23572#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23577#(= main_~x~0 0)} is VALID [2022-04-15 06:56:15,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {23577#(= main_~x~0 0)} [240] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1316 v_main_~x~0_1315)) (.cse1 (= |v_main_#t~post4_226| |v_main_#t~post4_225|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1316)) (and .cse0 .cse1) (and (< v_main_~x~0_1315 500001) (< v_main_~x~0_1316 v_main_~x~0_1315)))) InVars {main_~x~0=v_main_~x~0_1316, main_#t~post4=|v_main_#t~post4_226|} OutVars{main_~x~0=v_main_~x~0_1315, main_#t~post4=|v_main_#t~post4_225|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23578#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:15,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {23578#(<= main_~x~0 500000)} [241] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23578#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:15,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {23578#(<= main_~x~0 500000)} [242] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1318)) (.cse1 (= |v_main_#t~post6_402| |v_main_#t~post6_400|)) (.cse2 (= v_main_~x~0_1318 v_main_~x~0_1317))) (or (and .cse0 (< v_main_~y~0_990 v_main_~y~0_989) (= (+ v_main_~x~0_1318 (* v_main_~y~0_989 2)) (+ v_main_~x~0_1317 (* v_main_~y~0_990 2))) (< v_main_~y~0_989 (+ v_main_~y~0_990 2 (div (+ 999999 (* (- 1) v_main_~x~0_1318)) 2)))) (and (or (not .cse0) (not (< v_main_~x~0_1318 1000000))) .cse1 (= v_main_~y~0_989 v_main_~y~0_990) .cse2) (and (= v_main_~y~0_990 v_main_~y~0_989) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_990, main_~x~0=v_main_~x~0_1318, main_#t~post6=|v_main_#t~post6_402|} OutVars{main_~y~0=v_main_~y~0_989, main_~x~0=v_main_~x~0_1317, main_#t~post6=|v_main_#t~post6_400|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {23579#(<= main_~x~0 999999)} is VALID [2022-04-15 06:56:15,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {23579#(<= main_~x~0 999999)} [243] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23579#(<= main_~x~0 999999)} is VALID [2022-04-15 06:56:15,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {23579#(<= main_~x~0 999999)} [244] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_191| |v_main_#t~post5_190|)) (.cse2 (= v_main_~y~0_992 v_main_~y~0_991)) (.cse0 (<= 500000 v_main_~x~0_1320)) (.cse3 (= |v_main_#t~post6_405| |v_main_#t~post6_401|))) (or (and .cse0 (< v_main_~x~0_1320 v_main_~x~0_1319) (= (+ v_main_~x~0_1319 v_main_~y~0_992) (+ v_main_~x~0_1320 v_main_~y~0_991)) (< v_main_~x~0_1319 750001)) (and .cse1 .cse2 (= v_main_~x~0_1320 v_main_~x~0_1319) .cse3) (and .cse1 (= v_main_~x~0_1319 v_main_~x~0_1320) .cse2 (or (not (< v_main_~x~0_1320 750000)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_992, main_#t~post5=|v_main_#t~post5_191|, main_~x~0=v_main_~x~0_1320, main_#t~post6=|v_main_#t~post6_405|} OutVars{main_~y~0=v_main_~y~0_991, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_1319, main_#t~post6=|v_main_#t~post6_401|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23579#(<= main_~x~0 999999)} is VALID [2022-04-15 06:56:15,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {23579#(<= main_~x~0 999999)} [239] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {23573#false} is VALID [2022-04-15 06:56:15,777 INFO L272 TraceCheckUtils]: 12: Hoare triple {23573#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {23573#false} is VALID [2022-04-15 06:56:15,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {23573#false} ~cond := #in~cond; {23573#false} is VALID [2022-04-15 06:56:15,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {23573#false} assume 0 == ~cond; {23573#false} is VALID [2022-04-15 06:56:15,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {23573#false} assume !false; {23573#false} is VALID [2022-04-15 06:56:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:56:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240635655] [2022-04-15 06:56:15,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240635655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:15,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672136686] [2022-04-15 06:56:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:15,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:15,778 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:15,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 06:56:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:56:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:15,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:15,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {23572#true} call ULTIMATE.init(); {23572#true} is VALID [2022-04-15 06:56:15,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {23572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23572#true} is VALID [2022-04-15 06:56:15,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {23572#true} assume true; {23572#true} is VALID [2022-04-15 06:56:15,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23572#true} {23572#true} #48#return; {23572#true} is VALID [2022-04-15 06:56:15,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {23572#true} call #t~ret7 := main(); {23572#true} is VALID [2022-04-15 06:56:15,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {23572#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23599#(<= main_~x~0 0)} is VALID [2022-04-15 06:56:15,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {23599#(<= main_~x~0 0)} [240] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1316 v_main_~x~0_1315)) (.cse1 (= |v_main_#t~post4_226| |v_main_#t~post4_225|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1316)) (and .cse0 .cse1) (and (< v_main_~x~0_1315 500001) (< v_main_~x~0_1316 v_main_~x~0_1315)))) InVars {main_~x~0=v_main_~x~0_1316, main_#t~post4=|v_main_#t~post4_226|} OutVars{main_~x~0=v_main_~x~0_1315, main_#t~post4=|v_main_#t~post4_225|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23578#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:15,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {23578#(<= main_~x~0 500000)} [241] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23578#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:15,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {23578#(<= main_~x~0 500000)} [242] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1318)) (.cse1 (= |v_main_#t~post6_402| |v_main_#t~post6_400|)) (.cse2 (= v_main_~x~0_1318 v_main_~x~0_1317))) (or (and .cse0 (< v_main_~y~0_990 v_main_~y~0_989) (= (+ v_main_~x~0_1318 (* v_main_~y~0_989 2)) (+ v_main_~x~0_1317 (* v_main_~y~0_990 2))) (< v_main_~y~0_989 (+ v_main_~y~0_990 2 (div (+ 999999 (* (- 1) v_main_~x~0_1318)) 2)))) (and (or (not .cse0) (not (< v_main_~x~0_1318 1000000))) .cse1 (= v_main_~y~0_989 v_main_~y~0_990) .cse2) (and (= v_main_~y~0_990 v_main_~y~0_989) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_990, main_~x~0=v_main_~x~0_1318, main_#t~post6=|v_main_#t~post6_402|} OutVars{main_~y~0=v_main_~y~0_989, main_~x~0=v_main_~x~0_1317, main_#t~post6=|v_main_#t~post6_400|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {23578#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:15,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {23578#(<= main_~x~0 500000)} [243] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23578#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:15,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {23578#(<= main_~x~0 500000)} [244] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_191| |v_main_#t~post5_190|)) (.cse2 (= v_main_~y~0_992 v_main_~y~0_991)) (.cse0 (<= 500000 v_main_~x~0_1320)) (.cse3 (= |v_main_#t~post6_405| |v_main_#t~post6_401|))) (or (and .cse0 (< v_main_~x~0_1320 v_main_~x~0_1319) (= (+ v_main_~x~0_1319 v_main_~y~0_992) (+ v_main_~x~0_1320 v_main_~y~0_991)) (< v_main_~x~0_1319 750001)) (and .cse1 .cse2 (= v_main_~x~0_1320 v_main_~x~0_1319) .cse3) (and .cse1 (= v_main_~x~0_1319 v_main_~x~0_1320) .cse2 (or (not (< v_main_~x~0_1320 750000)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_992, main_#t~post5=|v_main_#t~post5_191|, main_~x~0=v_main_~x~0_1320, main_#t~post6=|v_main_#t~post6_405|} OutVars{main_~y~0=v_main_~y~0_991, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_1319, main_#t~post6=|v_main_#t~post6_401|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23615#(< main_~x~0 750001)} is VALID [2022-04-15 06:56:15,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {23615#(< main_~x~0 750001)} [239] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {23573#false} is VALID [2022-04-15 06:56:15,953 INFO L272 TraceCheckUtils]: 12: Hoare triple {23573#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {23573#false} is VALID [2022-04-15 06:56:15,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {23573#false} ~cond := #in~cond; {23573#false} is VALID [2022-04-15 06:56:15,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {23573#false} assume 0 == ~cond; {23573#false} is VALID [2022-04-15 06:56:15,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {23573#false} assume !false; {23573#false} is VALID [2022-04-15 06:56:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:15,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:28,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {23573#false} assume !false; {23573#false} is VALID [2022-04-15 06:56:28,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {23634#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {23573#false} is VALID [2022-04-15 06:56:28,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {23638#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23634#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:28,779 INFO L272 TraceCheckUtils]: 12: Hoare triple {23642#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {23638#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:28,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {23646#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [239] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {23642#(= main_~x~0 1000000)} is VALID [2022-04-15 06:56:28,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {23646#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [244] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_191| |v_main_#t~post5_190|)) (.cse2 (= v_main_~y~0_992 v_main_~y~0_991)) (.cse0 (<= 500000 v_main_~x~0_1320)) (.cse3 (= |v_main_#t~post6_405| |v_main_#t~post6_401|))) (or (and .cse0 (< v_main_~x~0_1320 v_main_~x~0_1319) (= (+ v_main_~x~0_1319 v_main_~y~0_992) (+ v_main_~x~0_1320 v_main_~y~0_991)) (< v_main_~x~0_1319 750001)) (and .cse1 .cse2 (= v_main_~x~0_1320 v_main_~x~0_1319) .cse3) (and .cse1 (= v_main_~x~0_1319 v_main_~x~0_1320) .cse2 (or (not (< v_main_~x~0_1320 750000)) (not .cse0)) .cse3))) InVars {main_~y~0=v_main_~y~0_992, main_#t~post5=|v_main_#t~post5_191|, main_~x~0=v_main_~x~0_1320, main_#t~post6=|v_main_#t~post6_405|} OutVars{main_~y~0=v_main_~y~0_991, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_1319, main_#t~post6=|v_main_#t~post6_401|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23646#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:28,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {23646#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [243] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23646#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:28,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {23656#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [242] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1318)) (.cse1 (= |v_main_#t~post6_402| |v_main_#t~post6_400|)) (.cse2 (= v_main_~x~0_1318 v_main_~x~0_1317))) (or (and .cse0 (< v_main_~y~0_990 v_main_~y~0_989) (= (+ v_main_~x~0_1318 (* v_main_~y~0_989 2)) (+ v_main_~x~0_1317 (* v_main_~y~0_990 2))) (< v_main_~y~0_989 (+ v_main_~y~0_990 2 (div (+ 999999 (* (- 1) v_main_~x~0_1318)) 2)))) (and (or (not .cse0) (not (< v_main_~x~0_1318 1000000))) .cse1 (= v_main_~y~0_989 v_main_~y~0_990) .cse2) (and (= v_main_~y~0_990 v_main_~y~0_989) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_990, main_~x~0=v_main_~x~0_1318, main_#t~post6=|v_main_#t~post6_402|} OutVars{main_~y~0=v_main_~y~0_989, main_~x~0=v_main_~x~0_1317, main_#t~post6=|v_main_#t~post6_400|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {23646#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:28,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {23656#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [241] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23656#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:56:28,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {23656#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [240] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1316 v_main_~x~0_1315)) (.cse1 (= |v_main_#t~post4_226| |v_main_#t~post4_225|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1316)) (and .cse0 .cse1) (and (< v_main_~x~0_1315 500001) (< v_main_~x~0_1316 v_main_~x~0_1315)))) InVars {main_~x~0=v_main_~x~0_1316, main_#t~post4=|v_main_#t~post4_226|} OutVars{main_~x~0=v_main_~x~0_1315, main_#t~post4=|v_main_#t~post4_225|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23656#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:56:28,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {23572#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23656#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:56:28,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {23572#true} call #t~ret7 := main(); {23572#true} is VALID [2022-04-15 06:56:28,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23572#true} {23572#true} #48#return; {23572#true} is VALID [2022-04-15 06:56:28,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {23572#true} assume true; {23572#true} is VALID [2022-04-15 06:56:28,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {23572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {23572#true} is VALID [2022-04-15 06:56:28,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {23572#true} call ULTIMATE.init(); {23572#true} is VALID [2022-04-15 06:56:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:28,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672136686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:28,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:56:30,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129092733] [2022-04-15 06:56:30,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129092733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:30,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:30,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:56:30,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713296952] [2022-04-15 06:56:30,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:30,061 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 06:56:30,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:30,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:30,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:30,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:56:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:30,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:56:30,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1994, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:56:30,169 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:38,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:38,847 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-04-15 06:56:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:56:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 06:56:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 164 transitions. [2022-04-15 06:56:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 164 transitions. [2022-04-15 06:56:38,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 164 transitions. [2022-04-15 06:56:38,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:38,983 INFO L225 Difference]: With dead ends: 175 [2022-04-15 06:56:38,983 INFO L226 Difference]: Without dead ends: 157 [2022-04-15 06:56:38,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=551, Invalid=6255, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 06:56:38,984 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 111 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4630 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:38,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 211 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4630 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:56:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-15 06:56:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-04-15 06:56:40,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:40,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:40,961 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:40,961 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:40,963 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2022-04-15 06:56:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2022-04-15 06:56:40,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:40,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:40,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 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 157 states. [2022-04-15 06:56:40,963 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 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 157 states. [2022-04-15 06:56:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:40,965 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2022-04-15 06:56:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2022-04-15 06:56:40,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:40,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:40,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:40,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-04-15 06:56:40,968 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 145 [2022-04-15 06:56:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:40,968 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-04-15 06:56:40,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.710526315789474) internal successors, (141), 37 states have internal predecessors, (141), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:40,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 156 transitions. [2022-04-15 06:56:41,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-04-15 06:56:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 06:56:41,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:41,295 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:41,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-15 06:56:41,496 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:41,496 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1652905175, now seen corresponding path program 32 times [2022-04-15 06:56:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:41,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390199470] [2022-04-15 06:56:41,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:44,321 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:56:44,431 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:44,703 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:44,704 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -227460441, now seen corresponding path program 1 times [2022-04-15 06:56:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:44,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119159552] [2022-04-15 06:56:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:44,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:44,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {24764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24756#true} is VALID [2022-04-15 06:56:44,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {24756#true} assume true; {24756#true} is VALID [2022-04-15 06:56:44,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24756#true} {24756#true} #48#return; {24756#true} is VALID [2022-04-15 06:56:44,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {24756#true} call ULTIMATE.init(); {24764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:44,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {24764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24756#true} is VALID [2022-04-15 06:56:44,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {24756#true} assume true; {24756#true} is VALID [2022-04-15 06:56:44,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24756#true} {24756#true} #48#return; {24756#true} is VALID [2022-04-15 06:56:44,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {24756#true} call #t~ret7 := main(); {24756#true} is VALID [2022-04-15 06:56:44,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {24756#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {24761#(= main_~x~0 0)} is VALID [2022-04-15 06:56:44,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {24761#(= main_~x~0 0)} [246] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_233| |v_main_#t~post4_232|)) (.cse1 (= v_main_~x~0_1374 v_main_~x~0_1373))) (or (and .cse0 (<= 500000 v_main_~x~0_1374) .cse1) (and (< v_main_~x~0_1373 500001) (< v_main_~x~0_1374 v_main_~x~0_1373)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1374, main_#t~post4=|v_main_#t~post4_233|} OutVars{main_~x~0=v_main_~x~0_1373, main_#t~post4=|v_main_#t~post4_232|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {24762#(<= main_~x~0 500000)} [247] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {24762#(<= main_~x~0 500000)} [248] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1038 v_main_~y~0_1037)) (.cse1 (= |v_main_#t~post6_415| |v_main_#t~post6_413|)) (.cse3 (= v_main_~x~0_1376 v_main_~x~0_1375)) (.cse2 (<= 750000 v_main_~x~0_1376))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1376 1000000))) .cse3) (and .cse0 .cse1 .cse3) (and (< v_main_~y~0_1037 (+ 2 v_main_~y~0_1038 (div (+ 999999 (* (- 1) v_main_~x~0_1376)) 2))) (= (+ v_main_~x~0_1375 (* 2 v_main_~y~0_1038)) (+ v_main_~x~0_1376 (* 2 v_main_~y~0_1037))) .cse2 (< v_main_~y~0_1038 v_main_~y~0_1037)))) InVars {main_~y~0=v_main_~y~0_1038, main_~x~0=v_main_~x~0_1376, main_#t~post6=|v_main_#t~post6_415|} OutVars{main_~y~0=v_main_~y~0_1037, main_~x~0=v_main_~x~0_1375, main_#t~post6=|v_main_#t~post6_413|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {24762#(<= main_~x~0 500000)} [249] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {24762#(<= main_~x~0 500000)} [250] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1378)) (.cse0 (= |v_main_#t~post5_197| |v_main_#t~post5_196|)) (.cse1 (= v_main_~y~0_1040 v_main_~y~0_1039)) (.cse2 (= v_main_~x~0_1378 v_main_~x~0_1377))) (or (and (= |v_main_#t~post6_414| |v_main_#t~post6_418|) .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1378 750000)) (not .cse3))) (let ((.cse4 (+ v_main_~x~0_1378 v_main_~y~0_1039))) (and (= (+ v_main_~x~0_1377 v_main_~y~0_1040) .cse4) (< .cse4 (+ 750001 v_main_~y~0_1040)) .cse3 (< v_main_~y~0_1040 v_main_~y~0_1039))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_418| |v_main_#t~post6_414|)))) InVars {main_~y~0=v_main_~y~0_1040, main_#t~post5=|v_main_#t~post5_197|, main_~x~0=v_main_~x~0_1378, main_#t~post6=|v_main_#t~post6_418|} OutVars{main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_196|, main_~x~0=v_main_~x~0_1377, main_#t~post6=|v_main_#t~post6_414|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24763#(<= main_~x~0 750000)} is VALID [2022-04-15 06:56:44,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {24763#(<= main_~x~0 750000)} [245] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {24757#false} is VALID [2022-04-15 06:56:44,752 INFO L272 TraceCheckUtils]: 12: Hoare triple {24757#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {24757#false} is VALID [2022-04-15 06:56:44,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {24757#false} ~cond := #in~cond; {24757#false} is VALID [2022-04-15 06:56:44,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {24757#false} assume 0 == ~cond; {24757#false} is VALID [2022-04-15 06:56:44,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {24757#false} assume !false; {24757#false} is VALID [2022-04-15 06:56:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:44,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119159552] [2022-04-15 06:56:44,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119159552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244669352] [2022-04-15 06:56:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:44,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:44,754 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:44,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 06:56:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:44,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:56:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:44,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {24756#true} call ULTIMATE.init(); {24756#true} is VALID [2022-04-15 06:56:44,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {24756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24756#true} is VALID [2022-04-15 06:56:44,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {24756#true} assume true; {24756#true} is VALID [2022-04-15 06:56:44,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24756#true} {24756#true} #48#return; {24756#true} is VALID [2022-04-15 06:56:44,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {24756#true} call #t~ret7 := main(); {24756#true} is VALID [2022-04-15 06:56:44,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {24756#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {24783#(<= main_~x~0 0)} is VALID [2022-04-15 06:56:44,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {24783#(<= main_~x~0 0)} [246] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_233| |v_main_#t~post4_232|)) (.cse1 (= v_main_~x~0_1374 v_main_~x~0_1373))) (or (and .cse0 (<= 500000 v_main_~x~0_1374) .cse1) (and (< v_main_~x~0_1373 500001) (< v_main_~x~0_1374 v_main_~x~0_1373)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1374, main_#t~post4=|v_main_#t~post4_233|} OutVars{main_~x~0=v_main_~x~0_1373, main_#t~post4=|v_main_#t~post4_232|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {24762#(<= main_~x~0 500000)} [247] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {24762#(<= main_~x~0 500000)} [248] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1038 v_main_~y~0_1037)) (.cse1 (= |v_main_#t~post6_415| |v_main_#t~post6_413|)) (.cse3 (= v_main_~x~0_1376 v_main_~x~0_1375)) (.cse2 (<= 750000 v_main_~x~0_1376))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1376 1000000))) .cse3) (and .cse0 .cse1 .cse3) (and (< v_main_~y~0_1037 (+ 2 v_main_~y~0_1038 (div (+ 999999 (* (- 1) v_main_~x~0_1376)) 2))) (= (+ v_main_~x~0_1375 (* 2 v_main_~y~0_1038)) (+ v_main_~x~0_1376 (* 2 v_main_~y~0_1037))) .cse2 (< v_main_~y~0_1038 v_main_~y~0_1037)))) InVars {main_~y~0=v_main_~y~0_1038, main_~x~0=v_main_~x~0_1376, main_#t~post6=|v_main_#t~post6_415|} OutVars{main_~y~0=v_main_~y~0_1037, main_~x~0=v_main_~x~0_1375, main_#t~post6=|v_main_#t~post6_413|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {24762#(<= main_~x~0 500000)} [249] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24762#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:44,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {24762#(<= main_~x~0 500000)} [250] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1378)) (.cse0 (= |v_main_#t~post5_197| |v_main_#t~post5_196|)) (.cse1 (= v_main_~y~0_1040 v_main_~y~0_1039)) (.cse2 (= v_main_~x~0_1378 v_main_~x~0_1377))) (or (and (= |v_main_#t~post6_414| |v_main_#t~post6_418|) .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1378 750000)) (not .cse3))) (let ((.cse4 (+ v_main_~x~0_1378 v_main_~y~0_1039))) (and (= (+ v_main_~x~0_1377 v_main_~y~0_1040) .cse4) (< .cse4 (+ 750001 v_main_~y~0_1040)) .cse3 (< v_main_~y~0_1040 v_main_~y~0_1039))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_418| |v_main_#t~post6_414|)))) InVars {main_~y~0=v_main_~y~0_1040, main_#t~post5=|v_main_#t~post5_197|, main_~x~0=v_main_~x~0_1378, main_#t~post6=|v_main_#t~post6_418|} OutVars{main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_196|, main_~x~0=v_main_~x~0_1377, main_#t~post6=|v_main_#t~post6_414|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24763#(<= main_~x~0 750000)} is VALID [2022-04-15 06:56:44,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {24763#(<= main_~x~0 750000)} [245] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {24757#false} is VALID [2022-04-15 06:56:44,931 INFO L272 TraceCheckUtils]: 12: Hoare triple {24757#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {24757#false} is VALID [2022-04-15 06:56:44,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {24757#false} ~cond := #in~cond; {24757#false} is VALID [2022-04-15 06:56:44,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {24757#false} assume 0 == ~cond; {24757#false} is VALID [2022-04-15 06:56:44,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {24757#false} assume !false; {24757#false} is VALID [2022-04-15 06:56:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:44,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:45,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {24757#false} assume !false; {24757#false} is VALID [2022-04-15 06:56:45,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {24817#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24757#false} is VALID [2022-04-15 06:56:45,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {24821#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24817#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:56:45,618 INFO L272 TraceCheckUtils]: 12: Hoare triple {24825#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {24821#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:56:45,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {24829#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [245] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {24825#(= main_~x~0 1000000)} is VALID [2022-04-15 06:56:45,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {24829#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [250] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1378)) (.cse0 (= |v_main_#t~post5_197| |v_main_#t~post5_196|)) (.cse1 (= v_main_~y~0_1040 v_main_~y~0_1039)) (.cse2 (= v_main_~x~0_1378 v_main_~x~0_1377))) (or (and (= |v_main_#t~post6_414| |v_main_#t~post6_418|) .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1378 750000)) (not .cse3))) (let ((.cse4 (+ v_main_~x~0_1378 v_main_~y~0_1039))) (and (= (+ v_main_~x~0_1377 v_main_~y~0_1040) .cse4) (< .cse4 (+ 750001 v_main_~y~0_1040)) .cse3 (< v_main_~y~0_1040 v_main_~y~0_1039))) (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_418| |v_main_#t~post6_414|)))) InVars {main_~y~0=v_main_~y~0_1040, main_#t~post5=|v_main_#t~post5_197|, main_~x~0=v_main_~x~0_1378, main_#t~post6=|v_main_#t~post6_418|} OutVars{main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_196|, main_~x~0=v_main_~x~0_1377, main_#t~post6=|v_main_#t~post6_414|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24829#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:45,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {24829#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [249] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24829#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:45,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {24839#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [248] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1038 v_main_~y~0_1037)) (.cse1 (= |v_main_#t~post6_415| |v_main_#t~post6_413|)) (.cse3 (= v_main_~x~0_1376 v_main_~x~0_1375)) (.cse2 (<= 750000 v_main_~x~0_1376))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_1376 1000000))) .cse3) (and .cse0 .cse1 .cse3) (and (< v_main_~y~0_1037 (+ 2 v_main_~y~0_1038 (div (+ 999999 (* (- 1) v_main_~x~0_1376)) 2))) (= (+ v_main_~x~0_1375 (* 2 v_main_~y~0_1038)) (+ v_main_~x~0_1376 (* 2 v_main_~y~0_1037))) .cse2 (< v_main_~y~0_1038 v_main_~y~0_1037)))) InVars {main_~y~0=v_main_~y~0_1038, main_~x~0=v_main_~x~0_1376, main_#t~post6=|v_main_#t~post6_415|} OutVars{main_~y~0=v_main_~y~0_1037, main_~x~0=v_main_~x~0_1375, main_#t~post6=|v_main_#t~post6_413|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {24829#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:56:45,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {24839#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [247] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24839#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:56:45,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {24839#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [246] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_233| |v_main_#t~post4_232|)) (.cse1 (= v_main_~x~0_1374 v_main_~x~0_1373))) (or (and .cse0 (<= 500000 v_main_~x~0_1374) .cse1) (and (< v_main_~x~0_1373 500001) (< v_main_~x~0_1374 v_main_~x~0_1373)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1374, main_#t~post4=|v_main_#t~post4_233|} OutVars{main_~x~0=v_main_~x~0_1373, main_#t~post4=|v_main_#t~post4_232|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24839#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:56:45,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {24756#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {24839#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:56:45,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {24756#true} call #t~ret7 := main(); {24756#true} is VALID [2022-04-15 06:56:45,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24756#true} {24756#true} #48#return; {24756#true} is VALID [2022-04-15 06:56:45,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {24756#true} assume true; {24756#true} is VALID [2022-04-15 06:56:45,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {24756#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {24756#true} is VALID [2022-04-15 06:56:45,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {24756#true} call ULTIMATE.init(); {24756#true} is VALID [2022-04-15 06:56:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:45,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244669352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:45,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:45,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:56:46,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:46,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390199470] [2022-04-15 06:56:46,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390199470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:46,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:46,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 06:56:46,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702584474] [2022-04-15 06:56:46,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:46,872 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 06:56:46,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:46,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:46,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:46,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 06:56:46,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:46,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 06:56:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=2031, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:56:46,971 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:56,392 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2022-04-15 06:56:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:56:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 06:56:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 168 transitions. [2022-04-15 06:56:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 168 transitions. [2022-04-15 06:56:56,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 168 transitions. [2022-04-15 06:56:56,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:56,531 INFO L225 Difference]: With dead ends: 179 [2022-04-15 06:56:56,531 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 06:56:56,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=486, Invalid=6486, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 06:56:56,532 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 113 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 5044 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 5083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 5044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:56,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 222 Invalid, 5083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 5044 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 06:56:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 06:56:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2022-04-15 06:56:58,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:58,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:58,612 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:58,612 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:58,614 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2022-04-15 06:56:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-04-15 06:56:58,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:58,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:58,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-15 06:56:58,615 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-15 06:56:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:58,617 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2022-04-15 06:56:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2022-04-15 06:56:58,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:58,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:58,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:58,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2022-04-15 06:56:58,619 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 149 [2022-04-15 06:56:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:58,620 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2022-04-15 06:56:58,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.717948717948718) internal successors, (145), 38 states have internal predecessors, (145), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:56:58,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 160 transitions. [2022-04-15 06:56:59,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-15 06:56:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 06:56:59,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:59,091 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:59,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 06:56:59,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 06:56:59,292 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash -255530834, now seen corresponding path program 33 times [2022-04-15 06:56:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:59,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2079224485] [2022-04-15 06:56:59,387 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:59,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:59,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:59,922 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash -587035417, now seen corresponding path program 1 times [2022-04-15 06:56:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:59,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173964824] [2022-04-15 06:56:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:59,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {25974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25966#true} is VALID [2022-04-15 06:56:59,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {25966#true} assume true; {25966#true} is VALID [2022-04-15 06:56:59,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25966#true} {25966#true} #48#return; {25966#true} is VALID [2022-04-15 06:56:59,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {25966#true} call ULTIMATE.init(); {25974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:59,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {25974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25966#true} is VALID [2022-04-15 06:56:59,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {25966#true} assume true; {25966#true} is VALID [2022-04-15 06:56:59,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25966#true} {25966#true} #48#return; {25966#true} is VALID [2022-04-15 06:56:59,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {25966#true} call #t~ret7 := main(); {25966#true} is VALID [2022-04-15 06:56:59,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {25966#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25971#(= main_~x~0 0)} is VALID [2022-04-15 06:56:59,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {25971#(= main_~x~0 0)} [252] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1433 v_main_~x~0_1432))) (or (and (< v_main_~x~0_1432 500001) (< v_main_~x~0_1433 v_main_~x~0_1432)) (and (not (< v_main_~x~0_1433 500000)) .cse0 (= |v_main_#t~post4_239| |v_main_#t~post4_240|)) (and .cse0 (= |v_main_#t~post4_240| |v_main_#t~post4_239|)))) InVars {main_~x~0=v_main_~x~0_1433, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_1432, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:59,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {25972#(<= main_~x~0 500000)} [253] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:59,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {25972#(<= main_~x~0 500000)} [254] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1435)) (.cse1 (= |v_main_#t~post6_428| |v_main_#t~post6_426|)) (.cse2 (= v_main_~y~0_1087 v_main_~y~0_1086)) (.cse3 (= v_main_~x~0_1435 v_main_~x~0_1434))) (or (and (< v_main_~y~0_1086 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1435)) 2) 2 v_main_~y~0_1087)) .cse0 (= (+ v_main_~x~0_1434 (* 2 v_main_~y~0_1087)) (+ v_main_~x~0_1435 (* 2 v_main_~y~0_1086))) (< v_main_~y~0_1087 v_main_~y~0_1086)) (and .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1435 1000000)) (not .cse0)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1087, main_~x~0=v_main_~x~0_1435, main_#t~post6=|v_main_#t~post6_428|} OutVars{main_~y~0=v_main_~y~0_1086, main_~x~0=v_main_~x~0_1434, main_#t~post6=|v_main_#t~post6_426|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:59,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {25972#(<= main_~x~0 500000)} [255] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:56:59,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {25972#(<= main_~x~0 500000)} [256] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1437)) (.cse0 (= v_main_~y~0_1089 v_main_~y~0_1088)) (.cse1 (= v_main_~x~0_1437 v_main_~x~0_1436)) (.cse2 (= |v_main_#t~post5_203| |v_main_#t~post5_202|))) (or (and .cse0 (= |v_main_#t~post6_431| |v_main_#t~post6_427|) .cse1 .cse2) (and .cse3 (< v_main_~x~0_1436 750001) (< v_main_~x~0_1437 v_main_~x~0_1436) (= (+ v_main_~x~0_1437 v_main_~y~0_1088) (+ v_main_~x~0_1436 v_main_~y~0_1089))) (and (or (not (< v_main_~x~0_1437 750000)) (not .cse3)) .cse0 .cse1 (= |v_main_#t~post6_427| |v_main_#t~post6_431|) .cse2))) InVars {main_~y~0=v_main_~y~0_1089, main_#t~post5=|v_main_#t~post5_203|, main_~x~0=v_main_~x~0_1437, main_#t~post6=|v_main_#t~post6_431|} OutVars{main_~y~0=v_main_~y~0_1088, main_#t~post5=|v_main_#t~post5_202|, main_~x~0=v_main_~x~0_1436, main_#t~post6=|v_main_#t~post6_427|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25973#(<= main_~x~0 750000)} is VALID [2022-04-15 06:56:59,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {25973#(<= main_~x~0 750000)} [251] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {25967#false} is VALID [2022-04-15 06:56:59,976 INFO L272 TraceCheckUtils]: 12: Hoare triple {25967#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {25967#false} is VALID [2022-04-15 06:56:59,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {25967#false} ~cond := #in~cond; {25967#false} is VALID [2022-04-15 06:56:59,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {25967#false} assume 0 == ~cond; {25967#false} is VALID [2022-04-15 06:56:59,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {25967#false} assume !false; {25967#false} is VALID [2022-04-15 06:56:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173964824] [2022-04-15 06:56:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173964824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857852094] [2022-04-15 06:56:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:59,980 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:59,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 06:57:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:00,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:57:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:00,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:00,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {25966#true} call ULTIMATE.init(); {25966#true} is VALID [2022-04-15 06:57:00,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {25966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25966#true} is VALID [2022-04-15 06:57:00,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {25966#true} assume true; {25966#true} is VALID [2022-04-15 06:57:00,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25966#true} {25966#true} #48#return; {25966#true} is VALID [2022-04-15 06:57:00,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {25966#true} call #t~ret7 := main(); {25966#true} is VALID [2022-04-15 06:57:00,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {25966#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25993#(<= main_~x~0 0)} is VALID [2022-04-15 06:57:00,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {25993#(<= main_~x~0 0)} [252] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1433 v_main_~x~0_1432))) (or (and (< v_main_~x~0_1432 500001) (< v_main_~x~0_1433 v_main_~x~0_1432)) (and (not (< v_main_~x~0_1433 500000)) .cse0 (= |v_main_#t~post4_239| |v_main_#t~post4_240|)) (and .cse0 (= |v_main_#t~post4_240| |v_main_#t~post4_239|)))) InVars {main_~x~0=v_main_~x~0_1433, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_1432, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:00,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {25972#(<= main_~x~0 500000)} [253] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:00,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {25972#(<= main_~x~0 500000)} [254] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1435)) (.cse1 (= |v_main_#t~post6_428| |v_main_#t~post6_426|)) (.cse2 (= v_main_~y~0_1087 v_main_~y~0_1086)) (.cse3 (= v_main_~x~0_1435 v_main_~x~0_1434))) (or (and (< v_main_~y~0_1086 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1435)) 2) 2 v_main_~y~0_1087)) .cse0 (= (+ v_main_~x~0_1434 (* 2 v_main_~y~0_1087)) (+ v_main_~x~0_1435 (* 2 v_main_~y~0_1086))) (< v_main_~y~0_1087 v_main_~y~0_1086)) (and .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1435 1000000)) (not .cse0)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1087, main_~x~0=v_main_~x~0_1435, main_#t~post6=|v_main_#t~post6_428|} OutVars{main_~y~0=v_main_~y~0_1086, main_~x~0=v_main_~x~0_1434, main_#t~post6=|v_main_#t~post6_426|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:00,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {25972#(<= main_~x~0 500000)} [255] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25972#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:00,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {25972#(<= main_~x~0 500000)} [256] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1437)) (.cse0 (= v_main_~y~0_1089 v_main_~y~0_1088)) (.cse1 (= v_main_~x~0_1437 v_main_~x~0_1436)) (.cse2 (= |v_main_#t~post5_203| |v_main_#t~post5_202|))) (or (and .cse0 (= |v_main_#t~post6_431| |v_main_#t~post6_427|) .cse1 .cse2) (and .cse3 (< v_main_~x~0_1436 750001) (< v_main_~x~0_1437 v_main_~x~0_1436) (= (+ v_main_~x~0_1437 v_main_~y~0_1088) (+ v_main_~x~0_1436 v_main_~y~0_1089))) (and (or (not (< v_main_~x~0_1437 750000)) (not .cse3)) .cse0 .cse1 (= |v_main_#t~post6_427| |v_main_#t~post6_431|) .cse2))) InVars {main_~y~0=v_main_~y~0_1089, main_#t~post5=|v_main_#t~post5_203|, main_~x~0=v_main_~x~0_1437, main_#t~post6=|v_main_#t~post6_431|} OutVars{main_~y~0=v_main_~y~0_1088, main_#t~post5=|v_main_#t~post5_202|, main_~x~0=v_main_~x~0_1436, main_#t~post6=|v_main_#t~post6_427|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25973#(<= main_~x~0 750000)} is VALID [2022-04-15 06:57:00,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {25973#(<= main_~x~0 750000)} [251] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {25967#false} is VALID [2022-04-15 06:57:00,164 INFO L272 TraceCheckUtils]: 12: Hoare triple {25967#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {25967#false} is VALID [2022-04-15 06:57:00,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {25967#false} ~cond := #in~cond; {25967#false} is VALID [2022-04-15 06:57:00,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {25967#false} assume 0 == ~cond; {25967#false} is VALID [2022-04-15 06:57:00,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {25967#false} assume !false; {25967#false} is VALID [2022-04-15 06:57:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:00,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:12,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {25967#false} assume !false; {25967#false} is VALID [2022-04-15 06:57:12,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {26027#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25967#false} is VALID [2022-04-15 06:57:12,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26027#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:12,817 INFO L272 TraceCheckUtils]: 12: Hoare triple {26035#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {26031#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:12,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {26039#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [251] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {26035#(= main_~x~0 1000000)} is VALID [2022-04-15 06:57:12,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {26039#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [256] L11-2-->L10-2_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1437)) (.cse0 (= v_main_~y~0_1089 v_main_~y~0_1088)) (.cse1 (= v_main_~x~0_1437 v_main_~x~0_1436)) (.cse2 (= |v_main_#t~post5_203| |v_main_#t~post5_202|))) (or (and .cse0 (= |v_main_#t~post6_431| |v_main_#t~post6_427|) .cse1 .cse2) (and .cse3 (< v_main_~x~0_1436 750001) (< v_main_~x~0_1437 v_main_~x~0_1436) (= (+ v_main_~x~0_1437 v_main_~y~0_1088) (+ v_main_~x~0_1436 v_main_~y~0_1089))) (and (or (not (< v_main_~x~0_1437 750000)) (not .cse3)) .cse0 .cse1 (= |v_main_#t~post6_427| |v_main_#t~post6_431|) .cse2))) InVars {main_~y~0=v_main_~y~0_1089, main_#t~post5=|v_main_#t~post5_203|, main_~x~0=v_main_~x~0_1437, main_#t~post6=|v_main_#t~post6_431|} OutVars{main_~y~0=v_main_~y~0_1088, main_#t~post5=|v_main_#t~post5_202|, main_~x~0=v_main_~x~0_1436, main_#t~post6=|v_main_#t~post6_427|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26039#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:12,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {26039#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [255] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26039#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:12,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {26049#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [254] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1435)) (.cse1 (= |v_main_#t~post6_428| |v_main_#t~post6_426|)) (.cse2 (= v_main_~y~0_1087 v_main_~y~0_1086)) (.cse3 (= v_main_~x~0_1435 v_main_~x~0_1434))) (or (and (< v_main_~y~0_1086 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1435)) 2) 2 v_main_~y~0_1087)) .cse0 (= (+ v_main_~x~0_1434 (* 2 v_main_~y~0_1087)) (+ v_main_~x~0_1435 (* 2 v_main_~y~0_1086))) (< v_main_~y~0_1087 v_main_~y~0_1086)) (and .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1435 1000000)) (not .cse0)) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1087, main_~x~0=v_main_~x~0_1435, main_#t~post6=|v_main_#t~post6_428|} OutVars{main_~y~0=v_main_~y~0_1086, main_~x~0=v_main_~x~0_1434, main_#t~post6=|v_main_#t~post6_426|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {26039#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:12,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {26049#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [253] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26049#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:57:12,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {26049#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [252] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1433 v_main_~x~0_1432))) (or (and (< v_main_~x~0_1432 500001) (< v_main_~x~0_1433 v_main_~x~0_1432)) (and (not (< v_main_~x~0_1433 500000)) .cse0 (= |v_main_#t~post4_239| |v_main_#t~post4_240|)) (and .cse0 (= |v_main_#t~post4_240| |v_main_#t~post4_239|)))) InVars {main_~x~0=v_main_~x~0_1433, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_1432, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {26049#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:57:12,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {25966#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {26049#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:57:12,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {25966#true} call #t~ret7 := main(); {25966#true} is VALID [2022-04-15 06:57:12,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25966#true} {25966#true} #48#return; {25966#true} is VALID [2022-04-15 06:57:12,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {25966#true} assume true; {25966#true} is VALID [2022-04-15 06:57:12,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {25966#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {25966#true} is VALID [2022-04-15 06:57:12,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {25966#true} call ULTIMATE.init(); {25966#true} is VALID [2022-04-15 06:57:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:12,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857852094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:12,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:12,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:57:14,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2079224485] [2022-04-15 06:57:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2079224485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:14,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:14,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:57:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033467810] [2022-04-15 06:57:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 06:57:14,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:14,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:14,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:14,191 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:57:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:14,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:57:14,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2122, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:57:14,191 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:24,166 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2022-04-15 06:57:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:57:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 153 [2022-04-15 06:57:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 172 transitions. [2022-04-15 06:57:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:24,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 172 transitions. [2022-04-15 06:57:24,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 172 transitions. [2022-04-15 06:57:24,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:24,299 INFO L225 Difference]: With dead ends: 183 [2022-04-15 06:57:24,299 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 06:57:24,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=498, Invalid=6812, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:57:24,300 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 116 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 5332 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 5372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 5332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:24,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 228 Invalid, 5372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 5332 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 06:57:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 06:57:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2022-04-15 06:57:26,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:26,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:26,548 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:26,549 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:26,550 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2022-04-15 06:57:26,550 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-04-15 06:57:26,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:26,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:26,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 06:57:26,550 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-15 06:57:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:26,552 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2022-04-15 06:57:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2022-04-15 06:57:26,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:26,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:26,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:26,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2022-04-15 06:57:26,555 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 153 [2022-04-15 06:57:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:26,555 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2022-04-15 06:57:26,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.725) internal successors, (149), 39 states have internal predecessors, (149), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:26,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 164 transitions. [2022-04-15 06:57:26,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:26,912 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2022-04-15 06:57:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 06:57:26,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:26,912 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:26,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:27,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 06:57:27,113 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1792588037, now seen corresponding path program 34 times [2022-04-15 06:57:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869927686] [2022-04-15 06:57:30,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:34,187 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:34,295 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:34,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:34,529 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -946610393, now seen corresponding path program 1 times [2022-04-15 06:57:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:34,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214512639] [2022-04-15 06:57:34,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:34,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {27211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27203#true} is VALID [2022-04-15 06:57:34,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {27203#true} assume true; {27203#true} is VALID [2022-04-15 06:57:34,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27203#true} {27203#true} #48#return; {27203#true} is VALID [2022-04-15 06:57:34,591 INFO L272 TraceCheckUtils]: 0: Hoare triple {27203#true} call ULTIMATE.init(); {27211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:34,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {27211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27203#true} is VALID [2022-04-15 06:57:34,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {27203#true} assume true; {27203#true} is VALID [2022-04-15 06:57:34,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27203#true} {27203#true} #48#return; {27203#true} is VALID [2022-04-15 06:57:34,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {27203#true} call #t~ret7 := main(); {27203#true} is VALID [2022-04-15 06:57:34,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {27203#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {27208#(= main_~x~0 0)} is VALID [2022-04-15 06:57:34,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {27208#(= main_~x~0 0)} [258] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1493 v_main_~x~0_1492)) (.cse1 (= |v_main_#t~post4_247| |v_main_#t~post4_246|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1493 v_main_~x~0_1492) (< v_main_~x~0_1492 500001)) (and .cse0 (not (< v_main_~x~0_1493 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1493, main_#t~post4=|v_main_#t~post4_247|} OutVars{main_~x~0=v_main_~x~0_1492, main_#t~post4=|v_main_#t~post4_246|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27209#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:34,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {27209#(<= main_~x~0 500000)} [259] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27209#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:34,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {27209#(<= main_~x~0 500000)} [260] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1495 v_main_~x~0_1494)) (.cse2 (= v_main_~y~0_1137 v_main_~y~0_1136)) (.cse0 (<= 750000 v_main_~x~0_1495))) (or (and (or (not (< v_main_~x~0_1495 1000000)) (not .cse0)) (= |v_main_#t~post6_439| |v_main_#t~post6_441|) .cse1 .cse2) (and (= |v_main_#t~post6_441| |v_main_#t~post6_439|) .cse1 .cse2) (and .cse0 (< v_main_~y~0_1136 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_1495)) 2) v_main_~y~0_1137)) (= (+ v_main_~x~0_1494 (* 2 v_main_~y~0_1137)) (+ v_main_~x~0_1495 (* 2 v_main_~y~0_1136))) (< v_main_~y~0_1137 v_main_~y~0_1136)))) InVars {main_~y~0=v_main_~y~0_1137, main_~x~0=v_main_~x~0_1495, main_#t~post6=|v_main_#t~post6_441|} OutVars{main_~y~0=v_main_~y~0_1136, main_~x~0=v_main_~x~0_1494, main_#t~post6=|v_main_#t~post6_439|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {27210#(<= main_~x~0 999999)} is VALID [2022-04-15 06:57:34,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {27210#(<= main_~x~0 999999)} [261] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27210#(<= main_~x~0 999999)} is VALID [2022-04-15 06:57:34,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {27210#(<= main_~x~0 999999)} [262] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1497)) (.cse2 (= |v_main_#t~post5_209| |v_main_#t~post5_208|)) (.cse3 (= |v_main_#t~post6_444| |v_main_#t~post6_440|)) (.cse4 (= v_main_~y~0_1139 v_main_~y~0_1138)) (.cse5 (= v_main_~x~0_1497 v_main_~x~0_1496))) (or (let ((.cse0 (+ v_main_~x~0_1497 v_main_~y~0_1138))) (and (< .cse0 (+ 750001 v_main_~y~0_1139)) (< v_main_~y~0_1139 v_main_~y~0_1138) .cse1 (= .cse0 (+ v_main_~x~0_1496 v_main_~y~0_1139)))) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1497 750000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1139, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_1497, main_#t~post6=|v_main_#t~post6_444|} OutVars{main_~y~0=v_main_~y~0_1138, main_#t~post5=|v_main_#t~post5_208|, main_~x~0=v_main_~x~0_1496, main_#t~post6=|v_main_#t~post6_440|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27210#(<= main_~x~0 999999)} is VALID [2022-04-15 06:57:34,595 INFO L290 TraceCheckUtils]: 11: Hoare triple {27210#(<= main_~x~0 999999)} [257] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {27204#false} is VALID [2022-04-15 06:57:34,595 INFO L272 TraceCheckUtils]: 12: Hoare triple {27204#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {27204#false} is VALID [2022-04-15 06:57:34,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {27204#false} ~cond := #in~cond; {27204#false} is VALID [2022-04-15 06:57:34,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {27204#false} assume 0 == ~cond; {27204#false} is VALID [2022-04-15 06:57:34,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {27204#false} assume !false; {27204#false} is VALID [2022-04-15 06:57:34,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:57:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214512639] [2022-04-15 06:57:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214512639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265542653] [2022-04-15 06:57:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:34,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:34,599 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:57:34,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 06:57:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:34,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:57:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:34,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:34,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {27203#true} call ULTIMATE.init(); {27203#true} is VALID [2022-04-15 06:57:34,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {27203#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27203#true} is VALID [2022-04-15 06:57:34,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {27203#true} assume true; {27203#true} is VALID [2022-04-15 06:57:34,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27203#true} {27203#true} #48#return; {27203#true} is VALID [2022-04-15 06:57:34,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {27203#true} call #t~ret7 := main(); {27203#true} is VALID [2022-04-15 06:57:34,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {27203#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {27230#(<= main_~x~0 0)} is VALID [2022-04-15 06:57:34,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {27230#(<= main_~x~0 0)} [258] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1493 v_main_~x~0_1492)) (.cse1 (= |v_main_#t~post4_247| |v_main_#t~post4_246|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1493 v_main_~x~0_1492) (< v_main_~x~0_1492 500001)) (and .cse0 (not (< v_main_~x~0_1493 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1493, main_#t~post4=|v_main_#t~post4_247|} OutVars{main_~x~0=v_main_~x~0_1492, main_#t~post4=|v_main_#t~post4_246|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27209#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:34,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {27209#(<= main_~x~0 500000)} [259] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27209#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:34,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {27209#(<= main_~x~0 500000)} [260] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1495 v_main_~x~0_1494)) (.cse2 (= v_main_~y~0_1137 v_main_~y~0_1136)) (.cse0 (<= 750000 v_main_~x~0_1495))) (or (and (or (not (< v_main_~x~0_1495 1000000)) (not .cse0)) (= |v_main_#t~post6_439| |v_main_#t~post6_441|) .cse1 .cse2) (and (= |v_main_#t~post6_441| |v_main_#t~post6_439|) .cse1 .cse2) (and .cse0 (< v_main_~y~0_1136 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_1495)) 2) v_main_~y~0_1137)) (= (+ v_main_~x~0_1494 (* 2 v_main_~y~0_1137)) (+ v_main_~x~0_1495 (* 2 v_main_~y~0_1136))) (< v_main_~y~0_1137 v_main_~y~0_1136)))) InVars {main_~y~0=v_main_~y~0_1137, main_~x~0=v_main_~x~0_1495, main_#t~post6=|v_main_#t~post6_441|} OutVars{main_~y~0=v_main_~y~0_1136, main_~x~0=v_main_~x~0_1494, main_#t~post6=|v_main_#t~post6_439|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {27209#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:34,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {27209#(<= main_~x~0 500000)} [261] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27209#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:34,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {27209#(<= main_~x~0 500000)} [262] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1497)) (.cse2 (= |v_main_#t~post5_209| |v_main_#t~post5_208|)) (.cse3 (= |v_main_#t~post6_444| |v_main_#t~post6_440|)) (.cse4 (= v_main_~y~0_1139 v_main_~y~0_1138)) (.cse5 (= v_main_~x~0_1497 v_main_~x~0_1496))) (or (let ((.cse0 (+ v_main_~x~0_1497 v_main_~y~0_1138))) (and (< .cse0 (+ 750001 v_main_~y~0_1139)) (< v_main_~y~0_1139 v_main_~y~0_1138) .cse1 (= .cse0 (+ v_main_~x~0_1496 v_main_~y~0_1139)))) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1497 750000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1139, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_1497, main_#t~post6=|v_main_#t~post6_444|} OutVars{main_~y~0=v_main_~y~0_1138, main_#t~post5=|v_main_#t~post5_208|, main_~x~0=v_main_~x~0_1496, main_#t~post6=|v_main_#t~post6_440|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27246#(< main_~x~0 750001)} is VALID [2022-04-15 06:57:34,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {27246#(< main_~x~0 750001)} [257] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {27204#false} is VALID [2022-04-15 06:57:34,809 INFO L272 TraceCheckUtils]: 12: Hoare triple {27204#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {27204#false} is VALID [2022-04-15 06:57:34,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {27204#false} ~cond := #in~cond; {27204#false} is VALID [2022-04-15 06:57:34,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {27204#false} assume 0 == ~cond; {27204#false} is VALID [2022-04-15 06:57:34,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {27204#false} assume !false; {27204#false} is VALID [2022-04-15 06:57:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:34,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:35,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {27204#false} assume !false; {27204#false} is VALID [2022-04-15 06:57:35,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {27265#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27204#false} is VALID [2022-04-15 06:57:35,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {27269#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27265#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:35,212 INFO L272 TraceCheckUtils]: 12: Hoare triple {27273#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {27269#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:35,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {27277#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [257] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {27273#(= main_~x~0 1000000)} is VALID [2022-04-15 06:57:35,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {27277#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [262] L11-2-->L10-2_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1497)) (.cse2 (= |v_main_#t~post5_209| |v_main_#t~post5_208|)) (.cse3 (= |v_main_#t~post6_444| |v_main_#t~post6_440|)) (.cse4 (= v_main_~y~0_1139 v_main_~y~0_1138)) (.cse5 (= v_main_~x~0_1497 v_main_~x~0_1496))) (or (let ((.cse0 (+ v_main_~x~0_1497 v_main_~y~0_1138))) (and (< .cse0 (+ 750001 v_main_~y~0_1139)) (< v_main_~y~0_1139 v_main_~y~0_1138) .cse1 (= .cse0 (+ v_main_~x~0_1496 v_main_~y~0_1139)))) (and .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1497 750000)) (not .cse1)) .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1139, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_1497, main_#t~post6=|v_main_#t~post6_444|} OutVars{main_~y~0=v_main_~y~0_1138, main_#t~post5=|v_main_#t~post5_208|, main_~x~0=v_main_~x~0_1496, main_#t~post6=|v_main_#t~post6_440|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27277#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:35,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {27277#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [261] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27277#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:35,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {27287#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [260] L11-2-->L10-2_primed: Formula: (let ((.cse1 (= v_main_~x~0_1495 v_main_~x~0_1494)) (.cse2 (= v_main_~y~0_1137 v_main_~y~0_1136)) (.cse0 (<= 750000 v_main_~x~0_1495))) (or (and (or (not (< v_main_~x~0_1495 1000000)) (not .cse0)) (= |v_main_#t~post6_439| |v_main_#t~post6_441|) .cse1 .cse2) (and (= |v_main_#t~post6_441| |v_main_#t~post6_439|) .cse1 .cse2) (and .cse0 (< v_main_~y~0_1136 (+ 2 (div (+ 999999 (* (- 1) v_main_~x~0_1495)) 2) v_main_~y~0_1137)) (= (+ v_main_~x~0_1494 (* 2 v_main_~y~0_1137)) (+ v_main_~x~0_1495 (* 2 v_main_~y~0_1136))) (< v_main_~y~0_1137 v_main_~y~0_1136)))) InVars {main_~y~0=v_main_~y~0_1137, main_~x~0=v_main_~x~0_1495, main_#t~post6=|v_main_#t~post6_441|} OutVars{main_~y~0=v_main_~y~0_1136, main_~x~0=v_main_~x~0_1494, main_#t~post6=|v_main_#t~post6_439|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {27277#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:35,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {27287#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [259] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27287#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:57:35,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {27287#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} [258] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1493 v_main_~x~0_1492)) (.cse1 (= |v_main_#t~post4_247| |v_main_#t~post4_246|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1493 v_main_~x~0_1492) (< v_main_~x~0_1492 500001)) (and .cse0 (not (< v_main_~x~0_1493 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1493, main_#t~post4=|v_main_#t~post4_247|} OutVars{main_~x~0=v_main_~x~0_1492, main_#t~post4=|v_main_#t~post4_246|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27287#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:57:35,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {27203#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {27287#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (not (<= 750000 main_~x~0)) (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ (- 1000001) main_~x~0) 2)) 0)))} is VALID [2022-04-15 06:57:35,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {27203#true} call #t~ret7 := main(); {27203#true} is VALID [2022-04-15 06:57:35,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27203#true} {27203#true} #48#return; {27203#true} is VALID [2022-04-15 06:57:35,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {27203#true} assume true; {27203#true} is VALID [2022-04-15 06:57:35,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {27203#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {27203#true} is VALID [2022-04-15 06:57:35,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {27203#true} call ULTIMATE.init(); {27203#true} is VALID [2022-04-15 06:57:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:35,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265542653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:35,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:35,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:57:36,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:36,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869927686] [2022-04-15 06:57:36,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869927686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:36,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:36,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 06:57:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127975671] [2022-04-15 06:57:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:36,618 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 06:57:36,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:36,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:36,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:36,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 06:57:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:36,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 06:57:36,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2270, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:57:36,722 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:47,023 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2022-04-15 06:57:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 06:57:47,023 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 06:57:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 176 transitions. [2022-04-15 06:57:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 176 transitions. [2022-04-15 06:57:47,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 176 transitions. [2022-04-15 06:57:47,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:47,164 INFO L225 Difference]: With dead ends: 187 [2022-04-15 06:57:47,164 INFO L226 Difference]: Without dead ends: 169 [2022-04-15 06:57:47,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=593, Invalid=7239, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 06:57:47,165 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 120 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 5482 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 5523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 5482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:47,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 229 Invalid, 5523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 5482 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 06:57:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-15 06:57:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2022-04-15 06:57:49,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:49,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:49,479 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:49,479 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:49,481 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2022-04-15 06:57:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-04-15 06:57:49,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:49,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:49,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 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 169 states. [2022-04-15 06:57:49,481 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 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 169 states. [2022-04-15 06:57:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:49,483 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2022-04-15 06:57:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-04-15 06:57:49,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:49,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:49,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:49,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.0314465408805031) internal successors, (164), 159 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-04-15 06:57:49,485 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 157 [2022-04-15 06:57:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:49,485 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-04-15 06:57:49,485 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.731707317073171) internal successors, (153), 40 states have internal predecessors, (153), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:49,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 168 transitions. [2022-04-15 06:57:49,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-15 06:57:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 06:57:49,861 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:49,861 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:49,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:50,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 06:57:50,063 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash 458130908, now seen corresponding path program 35 times [2022-04-15 06:57:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2058864169] [2022-04-15 06:57:54,139 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:54,187 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:54,406 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:54,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:54,638 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1306185369, now seen corresponding path program 1 times [2022-04-15 06:57:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30623437] [2022-04-15 06:57:54,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:54,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {28476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28468#true} is VALID [2022-04-15 06:57:54,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {28468#true} assume true; {28468#true} is VALID [2022-04-15 06:57:54,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28468#true} {28468#true} #48#return; {28468#true} is VALID [2022-04-15 06:57:54,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {28468#true} call ULTIMATE.init(); {28476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:54,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {28476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28468#true} is VALID [2022-04-15 06:57:54,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {28468#true} assume true; {28468#true} is VALID [2022-04-15 06:57:54,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28468#true} {28468#true} #48#return; {28468#true} is VALID [2022-04-15 06:57:54,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {28468#true} call #t~ret7 := main(); {28468#true} is VALID [2022-04-15 06:57:54,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {28468#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28473#(= main_~x~0 0)} is VALID [2022-04-15 06:57:54,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {28473#(= main_~x~0 0)} [264] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1554 v_main_~x~0_1553)) (.cse1 (= |v_main_#t~post4_254| |v_main_#t~post4_253|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1553 500001) (< v_main_~x~0_1554 v_main_~x~0_1553)) (and .cse0 .cse1 (not (< v_main_~x~0_1554 500000))))) InVars {main_~x~0=v_main_~x~0_1554, main_#t~post4=|v_main_#t~post4_254|} OutVars{main_~x~0=v_main_~x~0_1553, main_#t~post4=|v_main_#t~post4_253|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28474#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:54,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {28474#(<= main_~x~0 500000)} [265] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28474#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:54,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {28474#(<= main_~x~0 500000)} [266] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1188 v_main_~y~0_1187)) (.cse1 (= |v_main_#t~post6_454| |v_main_#t~post6_452|)) (.cse3 (<= 750000 v_main_~x~0_1556)) (.cse2 (= v_main_~x~0_1556 v_main_~x~0_1555))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= (+ v_main_~x~0_1556 (* 2 v_main_~y~0_1187)) (+ v_main_~x~0_1555 (* 2 v_main_~y~0_1188))) (< v_main_~y~0_1187 (+ (div (+ (* (- 1) v_main_~x~0_1556) 999999) 2) 2 v_main_~y~0_1188)) (< v_main_~y~0_1188 v_main_~y~0_1187)) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1556 1000000))) .cse2))) InVars {main_~y~0=v_main_~y~0_1188, main_~x~0=v_main_~x~0_1556, main_#t~post6=|v_main_#t~post6_454|} OutVars{main_~y~0=v_main_~y~0_1187, main_~x~0=v_main_~x~0_1555, main_#t~post6=|v_main_#t~post6_452|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {28474#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:54,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {28474#(<= main_~x~0 500000)} [267] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28474#(<= main_~x~0 500000)} is VALID [2022-04-15 06:57:54,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {28474#(<= main_~x~0 500000)} [268] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse1 (= v_main_~x~0_1558 v_main_~x~0_1557)) (.cse2 (= |v_main_#t~post6_457| |v_main_#t~post6_453|)) (.cse3 (<= 500000 v_main_~x~0_1558))) (or (and .cse0 .cse1 (= v_main_~y~0_1190 v_main_~y~0_1189) .cse2) (and (or (not .cse3) (not (< v_main_~x~0_1558 750000))) .cse0 .cse1 (= v_main_~y~0_1189 v_main_~y~0_1190) .cse2) (let ((.cse4 (+ v_main_~x~0_1558 v_main_~y~0_1189))) (and (= .cse4 (+ v_main_~x~0_1557 v_main_~y~0_1190)) (< v_main_~y~0_1190 v_main_~y~0_1189) (< .cse4 (+ 750001 v_main_~y~0_1190)) .cse3)))) InVars {main_~y~0=v_main_~y~0_1190, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_1558, main_#t~post6=|v_main_#t~post6_457|} OutVars{main_~y~0=v_main_~y~0_1189, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1557, main_#t~post6=|v_main_#t~post6_453|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28475#(<= main_~x~0 750000)} is VALID [2022-04-15 06:57:54,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {28475#(<= main_~x~0 750000)} [263] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {28469#false} is VALID [2022-04-15 06:57:54,698 INFO L272 TraceCheckUtils]: 12: Hoare triple {28469#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {28469#false} is VALID [2022-04-15 06:57:54,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {28469#false} ~cond := #in~cond; {28469#false} is VALID [2022-04-15 06:57:54,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {28469#false} assume 0 == ~cond; {28469#false} is VALID [2022-04-15 06:57:54,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {28469#false} assume !false; {28469#false} is VALID [2022-04-15 06:57:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30623437] [2022-04-15 06:57:54,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30623437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256355706] [2022-04-15 06:57:54,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:54,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:54,703 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:57:54,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 06:57:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:54,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:57:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:54,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:54,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {28468#true} call ULTIMATE.init(); {28468#true} is VALID [2022-04-15 06:57:54,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {28468#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28468#true} is VALID [2022-04-15 06:57:54,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {28468#true} assume true; {28468#true} is VALID [2022-04-15 06:57:54,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28468#true} {28468#true} #48#return; {28468#true} is VALID [2022-04-15 06:57:54,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {28468#true} call #t~ret7 := main(); {28468#true} is VALID [2022-04-15 06:57:54,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {28468#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28473#(= main_~x~0 0)} is VALID [2022-04-15 06:57:54,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {28473#(= main_~x~0 0)} [264] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1554 v_main_~x~0_1553)) (.cse1 (= |v_main_#t~post4_254| |v_main_#t~post4_253|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1553 500001) (< v_main_~x~0_1554 v_main_~x~0_1553)) (and .cse0 .cse1 (not (< v_main_~x~0_1554 500000))))) InVars {main_~x~0=v_main_~x~0_1554, main_#t~post4=|v_main_#t~post4_254|} OutVars{main_~x~0=v_main_~x~0_1553, main_#t~post4=|v_main_#t~post4_253|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:57:54,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [265] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:57:54,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [266] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1188 v_main_~y~0_1187)) (.cse1 (= |v_main_#t~post6_454| |v_main_#t~post6_452|)) (.cse3 (<= 750000 v_main_~x~0_1556)) (.cse2 (= v_main_~x~0_1556 v_main_~x~0_1555))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= (+ v_main_~x~0_1556 (* 2 v_main_~y~0_1187)) (+ v_main_~x~0_1555 (* 2 v_main_~y~0_1188))) (< v_main_~y~0_1187 (+ (div (+ (* (- 1) v_main_~x~0_1556) 999999) 2) 2 v_main_~y~0_1188)) (< v_main_~y~0_1188 v_main_~y~0_1187)) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1556 1000000))) .cse2))) InVars {main_~y~0=v_main_~y~0_1188, main_~x~0=v_main_~x~0_1556, main_#t~post6=|v_main_#t~post6_454|} OutVars{main_~y~0=v_main_~y~0_1187, main_~x~0=v_main_~x~0_1555, main_#t~post6=|v_main_#t~post6_452|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:57:54,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [267] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:57:54,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {28498#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [268] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse1 (= v_main_~x~0_1558 v_main_~x~0_1557)) (.cse2 (= |v_main_#t~post6_457| |v_main_#t~post6_453|)) (.cse3 (<= 500000 v_main_~x~0_1558))) (or (and .cse0 .cse1 (= v_main_~y~0_1190 v_main_~y~0_1189) .cse2) (and (or (not .cse3) (not (< v_main_~x~0_1558 750000))) .cse0 .cse1 (= v_main_~y~0_1189 v_main_~y~0_1190) .cse2) (let ((.cse4 (+ v_main_~x~0_1558 v_main_~y~0_1189))) (and (= .cse4 (+ v_main_~x~0_1557 v_main_~y~0_1190)) (< v_main_~y~0_1190 v_main_~y~0_1189) (< .cse4 (+ 750001 v_main_~y~0_1190)) .cse3)))) InVars {main_~y~0=v_main_~y~0_1190, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_1558, main_#t~post6=|v_main_#t~post6_457|} OutVars{main_~y~0=v_main_~y~0_1189, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1557, main_#t~post6=|v_main_#t~post6_453|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28511#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:57:54,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {28511#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [263] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {28469#false} is VALID [2022-04-15 06:57:54,961 INFO L272 TraceCheckUtils]: 12: Hoare triple {28469#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {28469#false} is VALID [2022-04-15 06:57:54,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {28469#false} ~cond := #in~cond; {28469#false} is VALID [2022-04-15 06:57:54,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {28469#false} assume 0 == ~cond; {28469#false} is VALID [2022-04-15 06:57:54,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {28469#false} assume !false; {28469#false} is VALID [2022-04-15 06:57:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:54,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:55,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {28469#false} assume !false; {28469#false} is VALID [2022-04-15 06:57:55,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {28530#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28469#false} is VALID [2022-04-15 06:57:55,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {28534#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28530#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:57:55,445 INFO L272 TraceCheckUtils]: 12: Hoare triple {28538#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {28534#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:57:55,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {28542#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [263] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {28538#(= main_~x~0 1000000)} is VALID [2022-04-15 06:57:55,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {28542#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [268] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse1 (= v_main_~x~0_1558 v_main_~x~0_1557)) (.cse2 (= |v_main_#t~post6_457| |v_main_#t~post6_453|)) (.cse3 (<= 500000 v_main_~x~0_1558))) (or (and .cse0 .cse1 (= v_main_~y~0_1190 v_main_~y~0_1189) .cse2) (and (or (not .cse3) (not (< v_main_~x~0_1558 750000))) .cse0 .cse1 (= v_main_~y~0_1189 v_main_~y~0_1190) .cse2) (let ((.cse4 (+ v_main_~x~0_1558 v_main_~y~0_1189))) (and (= .cse4 (+ v_main_~x~0_1557 v_main_~y~0_1190)) (< v_main_~y~0_1190 v_main_~y~0_1189) (< .cse4 (+ 750001 v_main_~y~0_1190)) .cse3)))) InVars {main_~y~0=v_main_~y~0_1190, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_1558, main_#t~post6=|v_main_#t~post6_457|} OutVars{main_~y~0=v_main_~y~0_1189, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1557, main_#t~post6=|v_main_#t~post6_453|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28542#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:55,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {28542#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [267] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28542#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:55,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {28552#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [266] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1188 v_main_~y~0_1187)) (.cse1 (= |v_main_#t~post6_454| |v_main_#t~post6_452|)) (.cse3 (<= 750000 v_main_~x~0_1556)) (.cse2 (= v_main_~x~0_1556 v_main_~x~0_1555))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= (+ v_main_~x~0_1556 (* 2 v_main_~y~0_1187)) (+ v_main_~x~0_1555 (* 2 v_main_~y~0_1188))) (< v_main_~y~0_1187 (+ (div (+ (* (- 1) v_main_~x~0_1556) 999999) 2) 2 v_main_~y~0_1188)) (< v_main_~y~0_1188 v_main_~y~0_1187)) (and .cse0 .cse1 (or (not .cse3) (not (< v_main_~x~0_1556 1000000))) .cse2))) InVars {main_~y~0=v_main_~y~0_1188, main_~x~0=v_main_~x~0_1556, main_#t~post6=|v_main_#t~post6_454|} OutVars{main_~y~0=v_main_~y~0_1187, main_~x~0=v_main_~x~0_1555, main_#t~post6=|v_main_#t~post6_452|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {28542#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:57:55,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {28552#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [265] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28552#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:57:55,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {28552#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [264] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1554 v_main_~x~0_1553)) (.cse1 (= |v_main_#t~post4_254| |v_main_#t~post4_253|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1553 500001) (< v_main_~x~0_1554 v_main_~x~0_1553)) (and .cse0 .cse1 (not (< v_main_~x~0_1554 500000))))) InVars {main_~x~0=v_main_~x~0_1554, main_#t~post4=|v_main_#t~post4_254|} OutVars{main_~x~0=v_main_~x~0_1553, main_#t~post4=|v_main_#t~post4_253|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28552#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:57:55,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {28468#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28552#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:57:55,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {28468#true} call #t~ret7 := main(); {28468#true} is VALID [2022-04-15 06:57:55,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28468#true} {28468#true} #48#return; {28468#true} is VALID [2022-04-15 06:57:55,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {28468#true} assume true; {28468#true} is VALID [2022-04-15 06:57:55,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {28468#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {28468#true} is VALID [2022-04-15 06:57:55,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {28468#true} call ULTIMATE.init(); {28468#true} is VALID [2022-04-15 06:57:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:55,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256355706] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:55,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:55,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:57:56,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:56,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2058864169] [2022-04-15 06:57:56,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2058864169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:56,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:56,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 06:57:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123776442] [2022-04-15 06:57:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:56,853 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-15 06:57:56,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:56,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:57:56,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:56,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 06:57:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 06:57:56,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2272, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:57:56,970 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:08,012 INFO L93 Difference]: Finished difference Result 191 states and 200 transitions. [2022-04-15 06:58:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 06:58:08,012 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-04-15 06:58:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2022-04-15 06:58:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2022-04-15 06:58:08,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 180 transitions. [2022-04-15 06:58:08,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:08,174 INFO L225 Difference]: With dead ends: 191 [2022-04-15 06:58:08,175 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 06:58:08,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=599, Invalid=7411, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 06:58:08,175 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 5932 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 5932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:08,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 240 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 5932 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 06:58:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 06:58:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2022-04-15 06:58:10,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:10,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:10,652 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:10,652 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:10,656 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2022-04-15 06:58:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-15 06:58:10,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:10,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:10,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 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 173 states. [2022-04-15 06:58:10,657 INFO L87 Difference]: Start difference. First operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 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 173 states. [2022-04-15 06:58:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:10,658 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2022-04-15 06:58:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 177 transitions. [2022-04-15 06:58:10,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:10,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:10,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:10,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.030674846625767) internal successors, (168), 163 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 172 transitions. [2022-04-15 06:58:10,660 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 172 transitions. Word has length 161 [2022-04-15 06:58:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:10,660 INFO L478 AbstractCegarLoop]: Abstraction has 168 states and 172 transitions. [2022-04-15 06:58:10,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.738095238095238) internal successors, (157), 41 states have internal predecessors, (157), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:10,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 168 states and 172 transitions. [2022-04-15 06:58:11,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 172 transitions. [2022-04-15 06:58:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-15 06:58:11,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:11,053 INFO L499 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:11,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 06:58:11,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:11,255 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:11,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash -808186061, now seen corresponding path program 36 times [2022-04-15 06:58:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:11,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794816201] [2022-04-15 06:58:15,324 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:15,372 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:15,584 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:19,714 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:19,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:19,834 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1665760345, now seen corresponding path program 1 times [2022-04-15 06:58:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:19,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19533884] [2022-04-15 06:58:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:19,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:19,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {29767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29759#true} is VALID [2022-04-15 06:58:19,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {29759#true} assume true; {29759#true} is VALID [2022-04-15 06:58:19,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29759#true} {29759#true} #48#return; {29759#true} is VALID [2022-04-15 06:58:19,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {29759#true} call ULTIMATE.init(); {29767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:19,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {29767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29759#true} is VALID [2022-04-15 06:58:19,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {29759#true} assume true; {29759#true} is VALID [2022-04-15 06:58:19,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29759#true} {29759#true} #48#return; {29759#true} is VALID [2022-04-15 06:58:19,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {29759#true} call #t~ret7 := main(); {29759#true} is VALID [2022-04-15 06:58:19,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {29759#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {29764#(= main_~x~0 0)} is VALID [2022-04-15 06:58:19,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {29764#(= main_~x~0 0)} [270] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_261| |v_main_#t~post4_260|))) (or (and .cse0 (= v_main_~x~0_1615 v_main_~x~0_1616) (not (< v_main_~x~0_1616 500000))) (and (< v_main_~x~0_1615 500001) (< v_main_~x~0_1616 v_main_~x~0_1615)) (and (= v_main_~x~0_1616 v_main_~x~0_1615) .cse0))) InVars {main_~x~0=v_main_~x~0_1616, main_#t~post4=|v_main_#t~post4_261|} OutVars{main_~x~0=v_main_~x~0_1615, main_#t~post4=|v_main_#t~post4_260|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29765#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:19,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {29765#(<= main_~x~0 500000)} [271] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29765#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:19,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {29765#(<= main_~x~0 500000)} [272] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1240 v_main_~y~0_1239)) (.cse1 (= |v_main_#t~post6_467| |v_main_#t~post6_465|)) (.cse2 (= v_main_~x~0_1618 v_main_~x~0_1617)) (.cse3 (<= 750000 v_main_~x~0_1618))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1618 1000000)))) (and .cse3 (< v_main_~y~0_1239 (+ 2 v_main_~y~0_1240 (div (+ (* (- 1) v_main_~x~0_1618) 999999) 2))) (= (+ v_main_~x~0_1617 (* 2 v_main_~y~0_1240)) (+ v_main_~x~0_1618 (* 2 v_main_~y~0_1239))) (< v_main_~y~0_1240 v_main_~y~0_1239)))) InVars {main_~y~0=v_main_~y~0_1240, main_~x~0=v_main_~x~0_1618, main_#t~post6=|v_main_#t~post6_467|} OutVars{main_~y~0=v_main_~y~0_1239, main_~x~0=v_main_~x~0_1617, main_#t~post6=|v_main_#t~post6_465|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {29765#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:19,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {29765#(<= main_~x~0 500000)} [273] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29765#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:19,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {29765#(<= main_~x~0 500000)} [274] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1242 v_main_~y~0_1241)) (.cse1 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse2 (= |v_main_#t~post6_470| |v_main_#t~post6_466|)) (.cse3 (<= 500000 v_main_~x~0_1620))) (or (and (= v_main_~x~0_1620 v_main_~x~0_1619) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1620 750000)) (not .cse3)) (= v_main_~x~0_1619 v_main_~x~0_1620)) (let ((.cse4 (+ v_main_~x~0_1620 v_main_~y~0_1241))) (and (< .cse4 (+ 750001 v_main_~y~0_1242)) (= .cse4 (+ v_main_~x~0_1619 v_main_~y~0_1242)) (< v_main_~y~0_1242 v_main_~y~0_1241) .cse3)))) InVars {main_~y~0=v_main_~y~0_1242, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1620, main_#t~post6=|v_main_#t~post6_470|} OutVars{main_~y~0=v_main_~y~0_1241, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1619, main_#t~post6=|v_main_#t~post6_466|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29766#(<= main_~x~0 750000)} is VALID [2022-04-15 06:58:19,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {29766#(<= main_~x~0 750000)} [269] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {29760#false} is VALID [2022-04-15 06:58:19,894 INFO L272 TraceCheckUtils]: 12: Hoare triple {29760#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {29760#false} is VALID [2022-04-15 06:58:19,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {29760#false} ~cond := #in~cond; {29760#false} is VALID [2022-04-15 06:58:19,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {29760#false} assume 0 == ~cond; {29760#false} is VALID [2022-04-15 06:58:19,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {29760#false} assume !false; {29760#false} is VALID [2022-04-15 06:58:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:19,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:19,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19533884] [2022-04-15 06:58:19,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19533884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:19,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367284959] [2022-04-15 06:58:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:19,899 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:58:19,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 06:58:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:19,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:58:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:19,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:20,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {29759#true} call ULTIMATE.init(); {29759#true} is VALID [2022-04-15 06:58:20,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {29759#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29759#true} is VALID [2022-04-15 06:58:20,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {29759#true} assume true; {29759#true} is VALID [2022-04-15 06:58:20,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29759#true} {29759#true} #48#return; {29759#true} is VALID [2022-04-15 06:58:20,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {29759#true} call #t~ret7 := main(); {29759#true} is VALID [2022-04-15 06:58:20,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {29759#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {29764#(= main_~x~0 0)} is VALID [2022-04-15 06:58:20,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {29764#(= main_~x~0 0)} [270] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_261| |v_main_#t~post4_260|))) (or (and .cse0 (= v_main_~x~0_1615 v_main_~x~0_1616) (not (< v_main_~x~0_1616 500000))) (and (< v_main_~x~0_1615 500001) (< v_main_~x~0_1616 v_main_~x~0_1615)) (and (= v_main_~x~0_1616 v_main_~x~0_1615) .cse0))) InVars {main_~x~0=v_main_~x~0_1616, main_#t~post4=|v_main_#t~post4_261|} OutVars{main_~x~0=v_main_~x~0_1615, main_#t~post4=|v_main_#t~post4_260|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:58:20,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [271] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:58:20,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [272] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1240 v_main_~y~0_1239)) (.cse1 (= |v_main_#t~post6_467| |v_main_#t~post6_465|)) (.cse2 (= v_main_~x~0_1618 v_main_~x~0_1617)) (.cse3 (<= 750000 v_main_~x~0_1618))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1618 1000000)))) (and .cse3 (< v_main_~y~0_1239 (+ 2 v_main_~y~0_1240 (div (+ (* (- 1) v_main_~x~0_1618) 999999) 2))) (= (+ v_main_~x~0_1617 (* 2 v_main_~y~0_1240)) (+ v_main_~x~0_1618 (* 2 v_main_~y~0_1239))) (< v_main_~y~0_1240 v_main_~y~0_1239)))) InVars {main_~y~0=v_main_~y~0_1240, main_~x~0=v_main_~x~0_1618, main_#t~post6=|v_main_#t~post6_467|} OutVars{main_~y~0=v_main_~y~0_1239, main_~x~0=v_main_~x~0_1617, main_#t~post6=|v_main_#t~post6_465|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:58:20,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [273] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {29789#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [274] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1242 v_main_~y~0_1241)) (.cse1 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse2 (= |v_main_#t~post6_470| |v_main_#t~post6_466|)) (.cse3 (<= 500000 v_main_~x~0_1620))) (or (and (= v_main_~x~0_1620 v_main_~x~0_1619) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1620 750000)) (not .cse3)) (= v_main_~x~0_1619 v_main_~x~0_1620)) (let ((.cse4 (+ v_main_~x~0_1620 v_main_~y~0_1241))) (and (< .cse4 (+ 750001 v_main_~y~0_1242)) (= .cse4 (+ v_main_~x~0_1619 v_main_~y~0_1242)) (< v_main_~y~0_1242 v_main_~y~0_1241) .cse3)))) InVars {main_~y~0=v_main_~y~0_1242, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1620, main_#t~post6=|v_main_#t~post6_470|} OutVars{main_~y~0=v_main_~y~0_1241, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1619, main_#t~post6=|v_main_#t~post6_466|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29802#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {29802#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [269] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {29760#false} is VALID [2022-04-15 06:58:20,190 INFO L272 TraceCheckUtils]: 12: Hoare triple {29760#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {29760#false} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {29760#false} ~cond := #in~cond; {29760#false} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {29760#false} assume 0 == ~cond; {29760#false} is VALID [2022-04-15 06:58:20,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {29760#false} assume !false; {29760#false} is VALID [2022-04-15 06:58:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:20,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:30,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {29760#false} assume !false; {29760#false} is VALID [2022-04-15 06:58:30,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {29821#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29760#false} is VALID [2022-04-15 06:58:30,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {29825#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29821#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:30,366 INFO L272 TraceCheckUtils]: 12: Hoare triple {29829#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {29825#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:30,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {29833#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [269] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {29829#(= main_~x~0 1000000)} is VALID [2022-04-15 06:58:30,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {29833#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [274] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1242 v_main_~y~0_1241)) (.cse1 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse2 (= |v_main_#t~post6_470| |v_main_#t~post6_466|)) (.cse3 (<= 500000 v_main_~x~0_1620))) (or (and (= v_main_~x~0_1620 v_main_~x~0_1619) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1620 750000)) (not .cse3)) (= v_main_~x~0_1619 v_main_~x~0_1620)) (let ((.cse4 (+ v_main_~x~0_1620 v_main_~y~0_1241))) (and (< .cse4 (+ 750001 v_main_~y~0_1242)) (= .cse4 (+ v_main_~x~0_1619 v_main_~y~0_1242)) (< v_main_~y~0_1242 v_main_~y~0_1241) .cse3)))) InVars {main_~y~0=v_main_~y~0_1242, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1620, main_#t~post6=|v_main_#t~post6_470|} OutVars{main_~y~0=v_main_~y~0_1241, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1619, main_#t~post6=|v_main_#t~post6_466|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29833#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:58:30,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {29833#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [273] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29833#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:58:30,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {29843#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [272] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1240 v_main_~y~0_1239)) (.cse1 (= |v_main_#t~post6_467| |v_main_#t~post6_465|)) (.cse2 (= v_main_~x~0_1618 v_main_~x~0_1617)) (.cse3 (<= 750000 v_main_~x~0_1618))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2 (or (not .cse3) (not (< v_main_~x~0_1618 1000000)))) (and .cse3 (< v_main_~y~0_1239 (+ 2 v_main_~y~0_1240 (div (+ (* (- 1) v_main_~x~0_1618) 999999) 2))) (= (+ v_main_~x~0_1617 (* 2 v_main_~y~0_1240)) (+ v_main_~x~0_1618 (* 2 v_main_~y~0_1239))) (< v_main_~y~0_1240 v_main_~y~0_1239)))) InVars {main_~y~0=v_main_~y~0_1240, main_~x~0=v_main_~x~0_1618, main_#t~post6=|v_main_#t~post6_467|} OutVars{main_~y~0=v_main_~y~0_1239, main_~x~0=v_main_~x~0_1617, main_#t~post6=|v_main_#t~post6_465|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {29833#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:58:30,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {29843#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [271] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29843#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:58:30,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {29843#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [270] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_261| |v_main_#t~post4_260|))) (or (and .cse0 (= v_main_~x~0_1615 v_main_~x~0_1616) (not (< v_main_~x~0_1616 500000))) (and (< v_main_~x~0_1615 500001) (< v_main_~x~0_1616 v_main_~x~0_1615)) (and (= v_main_~x~0_1616 v_main_~x~0_1615) .cse0))) InVars {main_~x~0=v_main_~x~0_1616, main_#t~post4=|v_main_#t~post4_261|} OutVars{main_~x~0=v_main_~x~0_1615, main_#t~post4=|v_main_#t~post4_260|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29843#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:58:30,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {29759#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {29843#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:58:30,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {29759#true} call #t~ret7 := main(); {29759#true} is VALID [2022-04-15 06:58:30,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29759#true} {29759#true} #48#return; {29759#true} is VALID [2022-04-15 06:58:30,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {29759#true} assume true; {29759#true} is VALID [2022-04-15 06:58:30,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {29759#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {29759#true} is VALID [2022-04-15 06:58:30,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {29759#true} call ULTIMATE.init(); {29759#true} is VALID [2022-04-15 06:58:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:30,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367284959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:30,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:30,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:58:31,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:31,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794816201] [2022-04-15 06:58:31,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794816201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:31,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:31,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:58:31,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43508982] [2022-04-15 06:58:31,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:31,885 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-15 06:58:31,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:31,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:31,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:31,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:58:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:58:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=2368, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 06:58:31,997 INFO L87 Difference]: Start difference. First operand 168 states and 172 transitions. Second operand has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:43,655 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2022-04-15 06:58:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:58:43,655 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2022-04-15 06:58:43,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 184 transitions. [2022-04-15 06:58:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 184 transitions. [2022-04-15 06:58:43,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 184 transitions. [2022-04-15 06:58:43,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:43,801 INFO L225 Difference]: With dead ends: 195 [2022-04-15 06:58:43,801 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 06:58:43,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=613, Invalid=7759, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 06:58:43,802 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 125 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6244 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 6244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:43,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 246 Invalid, 6287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 6244 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 06:58:43,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 06:58:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 172. [2022-04-15 06:58:46,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:46,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:46,405 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:46,405 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:46,407 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2022-04-15 06:58:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2022-04-15 06:58:46,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:46,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:46,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 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 177 states. [2022-04-15 06:58:46,407 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 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 177 states. [2022-04-15 06:58:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:46,409 INFO L93 Difference]: Finished difference Result 177 states and 181 transitions. [2022-04-15 06:58:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 181 transitions. [2022-04-15 06:58:46,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:46,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:46,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:46,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.029940119760479) internal successors, (172), 167 states have internal predecessors, (172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 176 transitions. [2022-04-15 06:58:46,411 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 176 transitions. Word has length 165 [2022-04-15 06:58:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:46,411 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 176 transitions. [2022-04-15 06:58:46,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.744186046511628) internal successors, (161), 42 states have internal predecessors, (161), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:46,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 176 transitions. [2022-04-15 06:58:46,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 176 transitions. [2022-04-15 06:58:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-15 06:58:46,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:46,830 INFO L499 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:46,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 06:58:47,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:58:47,031 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:47,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1228346634, now seen corresponding path program 37 times [2022-04-15 06:58:47,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:47,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485171218] [2022-04-15 06:58:51,110 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:58:51,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:51,391 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:51,637 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:51,639 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2025335321, now seen corresponding path program 1 times [2022-04-15 06:58:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:51,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387031017] [2022-04-15 06:58:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:51,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {31085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31077#true} is VALID [2022-04-15 06:58:51,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {31077#true} assume true; {31077#true} is VALID [2022-04-15 06:58:51,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31077#true} {31077#true} #48#return; {31077#true} is VALID [2022-04-15 06:58:51,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {31077#true} call ULTIMATE.init(); {31085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:51,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {31085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31077#true} is VALID [2022-04-15 06:58:51,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {31077#true} assume true; {31077#true} is VALID [2022-04-15 06:58:51,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31077#true} {31077#true} #48#return; {31077#true} is VALID [2022-04-15 06:58:51,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {31077#true} call #t~ret7 := main(); {31077#true} is VALID [2022-04-15 06:58:51,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {31077#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {31082#(= main_~x~0 0)} is VALID [2022-04-15 06:58:51,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {31082#(= main_~x~0 0)} [276] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1679 v_main_~x~0_1678)) (.cse1 (= |v_main_#t~post4_268| |v_main_#t~post4_267|))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1679) .cse0 .cse1) (and (< v_main_~x~0_1678 500001) (< v_main_~x~0_1679 v_main_~x~0_1678)))) InVars {main_~x~0=v_main_~x~0_1679, main_#t~post4=|v_main_#t~post4_268|} OutVars{main_~x~0=v_main_~x~0_1678, main_#t~post4=|v_main_#t~post4_267|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31083#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:51,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {31083#(<= main_~x~0 500000)} [277] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31083#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:51,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {31083#(<= main_~x~0 500000)} [278] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1681 v_main_~x~0_1680)) (.cse1 (<= 750000 v_main_~x~0_1681))) (or (and .cse0 (= v_main_~y~0_1293 v_main_~y~0_1292) (= |v_main_#t~post6_480| |v_main_#t~post6_478|)) (and (< v_main_~y~0_1292 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1681)) 2) 2 v_main_~y~0_1293)) (< v_main_~y~0_1293 v_main_~y~0_1292) (= (+ (* 2 v_main_~y~0_1292) v_main_~x~0_1681) (+ v_main_~x~0_1680 (* 2 v_main_~y~0_1293))) .cse1) (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1681 1000000))) (= |v_main_#t~post6_478| |v_main_#t~post6_480|) (= v_main_~y~0_1292 v_main_~y~0_1293)))) InVars {main_~y~0=v_main_~y~0_1293, main_~x~0=v_main_~x~0_1681, main_#t~post6=|v_main_#t~post6_480|} OutVars{main_~y~0=v_main_~y~0_1292, main_~x~0=v_main_~x~0_1680, main_#t~post6=|v_main_#t~post6_478|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {31084#(<= main_~x~0 999999)} is VALID [2022-04-15 06:58:51,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {31084#(<= main_~x~0 999999)} [279] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31084#(<= main_~x~0 999999)} is VALID [2022-04-15 06:58:51,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {31084#(<= main_~x~0 999999)} [280] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1683)) (.cse1 (= |v_main_#t~post5_227| |v_main_#t~post5_226|)) (.cse2 (= v_main_~x~0_1683 v_main_~x~0_1682)) (.cse3 (= v_main_~y~0_1295 v_main_~y~0_1294))) (or (and .cse0 (< v_main_~x~0_1682 750001) (< v_main_~x~0_1683 v_main_~x~0_1682) (= (+ v_main_~x~0_1682 v_main_~y~0_1295) (+ v_main_~x~0_1683 v_main_~y~0_1294))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1683 750000))) (= |v_main_#t~post6_479| |v_main_#t~post6_483|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post6_483| |v_main_#t~post6_479|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1295, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_1683, main_#t~post6=|v_main_#t~post6_483|} OutVars{main_~y~0=v_main_~y~0_1294, main_#t~post5=|v_main_#t~post5_226|, main_~x~0=v_main_~x~0_1682, main_#t~post6=|v_main_#t~post6_479|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31084#(<= main_~x~0 999999)} is VALID [2022-04-15 06:58:51,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {31084#(<= main_~x~0 999999)} [275] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {31078#false} is VALID [2022-04-15 06:58:51,699 INFO L272 TraceCheckUtils]: 12: Hoare triple {31078#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {31078#false} is VALID [2022-04-15 06:58:51,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {31078#false} ~cond := #in~cond; {31078#false} is VALID [2022-04-15 06:58:51,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {31078#false} assume 0 == ~cond; {31078#false} is VALID [2022-04-15 06:58:51,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {31078#false} assume !false; {31078#false} is VALID [2022-04-15 06:58:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:58:51,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387031017] [2022-04-15 06:58:51,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387031017] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:51,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452949653] [2022-04-15 06:58:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:51,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:51,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:51,701 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:58:51,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 06:58:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:51,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:58:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:51,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:51,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {31077#true} call ULTIMATE.init(); {31077#true} is VALID [2022-04-15 06:58:51,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {31077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31077#true} is VALID [2022-04-15 06:58:51,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {31077#true} assume true; {31077#true} is VALID [2022-04-15 06:58:51,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31077#true} {31077#true} #48#return; {31077#true} is VALID [2022-04-15 06:58:51,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {31077#true} call #t~ret7 := main(); {31077#true} is VALID [2022-04-15 06:58:51,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {31077#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {31104#(<= main_~x~0 0)} is VALID [2022-04-15 06:58:51,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {31104#(<= main_~x~0 0)} [276] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1679 v_main_~x~0_1678)) (.cse1 (= |v_main_#t~post4_268| |v_main_#t~post4_267|))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1679) .cse0 .cse1) (and (< v_main_~x~0_1678 500001) (< v_main_~x~0_1679 v_main_~x~0_1678)))) InVars {main_~x~0=v_main_~x~0_1679, main_#t~post4=|v_main_#t~post4_268|} OutVars{main_~x~0=v_main_~x~0_1678, main_#t~post4=|v_main_#t~post4_267|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31083#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:51,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {31083#(<= main_~x~0 500000)} [277] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31083#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:51,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {31083#(<= main_~x~0 500000)} [278] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1681 v_main_~x~0_1680)) (.cse1 (<= 750000 v_main_~x~0_1681))) (or (and .cse0 (= v_main_~y~0_1293 v_main_~y~0_1292) (= |v_main_#t~post6_480| |v_main_#t~post6_478|)) (and (< v_main_~y~0_1292 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1681)) 2) 2 v_main_~y~0_1293)) (< v_main_~y~0_1293 v_main_~y~0_1292) (= (+ (* 2 v_main_~y~0_1292) v_main_~x~0_1681) (+ v_main_~x~0_1680 (* 2 v_main_~y~0_1293))) .cse1) (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1681 1000000))) (= |v_main_#t~post6_478| |v_main_#t~post6_480|) (= v_main_~y~0_1292 v_main_~y~0_1293)))) InVars {main_~y~0=v_main_~y~0_1293, main_~x~0=v_main_~x~0_1681, main_#t~post6=|v_main_#t~post6_480|} OutVars{main_~y~0=v_main_~y~0_1292, main_~x~0=v_main_~x~0_1680, main_#t~post6=|v_main_#t~post6_478|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {31083#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:51,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {31083#(<= main_~x~0 500000)} [279] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31083#(<= main_~x~0 500000)} is VALID [2022-04-15 06:58:51,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {31083#(<= main_~x~0 500000)} [280] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1683)) (.cse1 (= |v_main_#t~post5_227| |v_main_#t~post5_226|)) (.cse2 (= v_main_~x~0_1683 v_main_~x~0_1682)) (.cse3 (= v_main_~y~0_1295 v_main_~y~0_1294))) (or (and .cse0 (< v_main_~x~0_1682 750001) (< v_main_~x~0_1683 v_main_~x~0_1682) (= (+ v_main_~x~0_1682 v_main_~y~0_1295) (+ v_main_~x~0_1683 v_main_~y~0_1294))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1683 750000))) (= |v_main_#t~post6_479| |v_main_#t~post6_483|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post6_483| |v_main_#t~post6_479|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1295, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_1683, main_#t~post6=|v_main_#t~post6_483|} OutVars{main_~y~0=v_main_~y~0_1294, main_#t~post5=|v_main_#t~post5_226|, main_~x~0=v_main_~x~0_1682, main_#t~post6=|v_main_#t~post6_479|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31120#(< main_~x~0 750001)} is VALID [2022-04-15 06:58:51,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {31120#(< main_~x~0 750001)} [275] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {31078#false} is VALID [2022-04-15 06:58:51,896 INFO L272 TraceCheckUtils]: 12: Hoare triple {31078#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {31078#false} is VALID [2022-04-15 06:58:51,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {31078#false} ~cond := #in~cond; {31078#false} is VALID [2022-04-15 06:58:51,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {31078#false} assume 0 == ~cond; {31078#false} is VALID [2022-04-15 06:58:51,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {31078#false} assume !false; {31078#false} is VALID [2022-04-15 06:58:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:51,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:52,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {31078#false} assume !false; {31078#false} is VALID [2022-04-15 06:58:52,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {31139#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31078#false} is VALID [2022-04-15 06:58:52,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {31143#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {31139#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:58:52,576 INFO L272 TraceCheckUtils]: 12: Hoare triple {31147#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {31143#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:58:52,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {31151#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [275] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {31147#(= main_~x~0 1000000)} is VALID [2022-04-15 06:58:52,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {31151#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [280] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1683)) (.cse1 (= |v_main_#t~post5_227| |v_main_#t~post5_226|)) (.cse2 (= v_main_~x~0_1683 v_main_~x~0_1682)) (.cse3 (= v_main_~y~0_1295 v_main_~y~0_1294))) (or (and .cse0 (< v_main_~x~0_1682 750001) (< v_main_~x~0_1683 v_main_~x~0_1682) (= (+ v_main_~x~0_1682 v_main_~y~0_1295) (+ v_main_~x~0_1683 v_main_~y~0_1294))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1683 750000))) (= |v_main_#t~post6_479| |v_main_#t~post6_483|) .cse2 .cse3) (and .cse1 (= |v_main_#t~post6_483| |v_main_#t~post6_479|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1295, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_1683, main_#t~post6=|v_main_#t~post6_483|} OutVars{main_~y~0=v_main_~y~0_1294, main_#t~post5=|v_main_#t~post5_226|, main_~x~0=v_main_~x~0_1682, main_#t~post6=|v_main_#t~post6_479|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31151#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:58:52,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {31151#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [279] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31151#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:58:52,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {31161#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [278] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1681 v_main_~x~0_1680)) (.cse1 (<= 750000 v_main_~x~0_1681))) (or (and .cse0 (= v_main_~y~0_1293 v_main_~y~0_1292) (= |v_main_#t~post6_480| |v_main_#t~post6_478|)) (and (< v_main_~y~0_1292 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1681)) 2) 2 v_main_~y~0_1293)) (< v_main_~y~0_1293 v_main_~y~0_1292) (= (+ (* 2 v_main_~y~0_1292) v_main_~x~0_1681) (+ v_main_~x~0_1680 (* 2 v_main_~y~0_1293))) .cse1) (and .cse0 (or (not .cse1) (not (< v_main_~x~0_1681 1000000))) (= |v_main_#t~post6_478| |v_main_#t~post6_480|) (= v_main_~y~0_1292 v_main_~y~0_1293)))) InVars {main_~y~0=v_main_~y~0_1293, main_~x~0=v_main_~x~0_1681, main_#t~post6=|v_main_#t~post6_480|} OutVars{main_~y~0=v_main_~y~0_1292, main_~x~0=v_main_~x~0_1680, main_#t~post6=|v_main_#t~post6_478|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {31151#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:58:52,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {31161#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [277] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31161#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:58:52,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {31161#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [276] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1679 v_main_~x~0_1678)) (.cse1 (= |v_main_#t~post4_268| |v_main_#t~post4_267|))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1679) .cse0 .cse1) (and (< v_main_~x~0_1678 500001) (< v_main_~x~0_1679 v_main_~x~0_1678)))) InVars {main_~x~0=v_main_~x~0_1679, main_#t~post4=|v_main_#t~post4_268|} OutVars{main_~x~0=v_main_~x~0_1678, main_#t~post4=|v_main_#t~post4_267|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31161#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:58:52,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {31077#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {31161#(and (or (not (<= 750000 main_~x~0)) (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) (div (+ 1000000 (* (- 1) main_~x~0)) (- 2)) 1) 0)) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:58:52,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {31077#true} call #t~ret7 := main(); {31077#true} is VALID [2022-04-15 06:58:52,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31077#true} {31077#true} #48#return; {31077#true} is VALID [2022-04-15 06:58:52,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {31077#true} assume true; {31077#true} is VALID [2022-04-15 06:58:52,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {31077#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {31077#true} is VALID [2022-04-15 06:58:52,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {31077#true} call ULTIMATE.init(); {31077#true} is VALID [2022-04-15 06:58:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:52,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452949653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:52,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:52,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:58:54,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:54,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485171218] [2022-04-15 06:58:54,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485171218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:54,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:54,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 06:58:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775487651] [2022-04-15 06:58:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-15 06:58:54,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:54,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:58:54,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:54,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 06:58:54,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:54,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 06:58:54,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2564, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:58:54,222 INFO L87 Difference]: Start difference. First operand 172 states and 176 transitions. Second operand has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:06,242 INFO L93 Difference]: Finished difference Result 199 states and 208 transitions. [2022-04-15 06:59:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:59:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 169 [2022-04-15 06:59:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 188 transitions. [2022-04-15 06:59:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 188 transitions. [2022-04-15 06:59:06,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 188 transitions. [2022-04-15 06:59:06,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:06,409 INFO L225 Difference]: With dead ends: 199 [2022-04-15 06:59:06,409 INFO L226 Difference]: Without dead ends: 181 [2022-04-15 06:59:06,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=635, Invalid=8295, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 06:59:06,410 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 129 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6404 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 6448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 6404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:06,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 247 Invalid, 6448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 6404 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 06:59:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-15 06:59:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2022-04-15 06:59:09,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:09,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:09,170 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:09,171 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:09,172 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2022-04-15 06:59:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-15 06:59:09,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:09,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:09,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-15 06:59:09,173 INFO L87 Difference]: Start difference. First operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 181 states. [2022-04-15 06:59:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:09,175 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2022-04-15 06:59:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2022-04-15 06:59:09,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:09,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:09,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:09,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.0292397660818713) internal successors, (176), 171 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:09,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2022-04-15 06:59:09,178 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 169 [2022-04-15 06:59:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:09,178 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2022-04-15 06:59:09,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:09,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 180 transitions. [2022-04-15 06:59:09,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2022-04-15 06:59:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-15 06:59:09,648 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:09,648 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:09,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:09,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:59:09,849 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1419421855, now seen corresponding path program 38 times [2022-04-15 06:59:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:09,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598775271] [2022-04-15 06:59:09,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:10,810 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:10,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:11,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:11,161 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1910056999, now seen corresponding path program 1 times [2022-04-15 06:59:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:11,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572632004] [2022-04-15 06:59:11,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:11,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:11,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {32431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32423#true} is VALID [2022-04-15 06:59:11,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {32423#true} assume true; {32423#true} is VALID [2022-04-15 06:59:11,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32423#true} {32423#true} #48#return; {32423#true} is VALID [2022-04-15 06:59:11,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {32423#true} call ULTIMATE.init(); {32431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:11,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {32431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32423#true} is VALID [2022-04-15 06:59:11,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {32423#true} assume true; {32423#true} is VALID [2022-04-15 06:59:11,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32423#true} {32423#true} #48#return; {32423#true} is VALID [2022-04-15 06:59:11,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {32423#true} call #t~ret7 := main(); {32423#true} is VALID [2022-04-15 06:59:11,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {32423#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {32428#(= main_~x~0 0)} is VALID [2022-04-15 06:59:11,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {32428#(= main_~x~0 0)} [282] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_275| |v_main_#t~post4_274|)) (.cse1 (= v_main_~x~0_1743 v_main_~x~0_1742))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1743 500000)) .cse0 .cse1) (and (< v_main_~x~0_1742 500001) (< v_main_~x~0_1743 v_main_~x~0_1742)))) InVars {main_~x~0=v_main_~x~0_1743, main_#t~post4=|v_main_#t~post4_275|} OutVars{main_~x~0=v_main_~x~0_1742, main_#t~post4=|v_main_#t~post4_274|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32429#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:11,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {32429#(<= main_~x~0 500000)} [283] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32429#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:11,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {32429#(<= main_~x~0 500000)} [284] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1745)) (.cse1 (= v_main_~x~0_1745 v_main_~x~0_1744)) (.cse2 (= v_main_~y~0_1347 v_main_~y~0_1346)) (.cse3 (= |v_main_#t~post6_493| |v_main_#t~post6_491|))) (or (and (< v_main_~y~0_1347 v_main_~y~0_1346) (< v_main_~y~0_1346 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1745)) 2) 2 v_main_~y~0_1347)) .cse0 (= (+ v_main_~x~0_1745 (* 2 v_main_~y~0_1346)) (+ v_main_~x~0_1744 (* 2 v_main_~y~0_1347)))) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1745 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1347, main_~x~0=v_main_~x~0_1745, main_#t~post6=|v_main_#t~post6_493|} OutVars{main_~y~0=v_main_~y~0_1346, main_~x~0=v_main_~x~0_1744, main_#t~post6=|v_main_#t~post6_491|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {32430#(<= main_~x~0 999999)} is VALID [2022-04-15 06:59:11,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {32430#(<= main_~x~0 999999)} [285] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32430#(<= main_~x~0 999999)} is VALID [2022-04-15 06:59:11,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {32430#(<= main_~x~0 999999)} [286] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1349 v_main_~y~0_1348)) (.cse1 (= |v_main_#t~post5_233| |v_main_#t~post5_232|)) (.cse2 (= v_main_~x~0_1747 v_main_~x~0_1746)) (.cse3 (= |v_main_#t~post6_496| |v_main_#t~post6_492|)) (.cse4 (<= 500000 v_main_~x~0_1747))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1747 750000)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (< v_main_~x~0_1746 750001) (= (+ v_main_~x~0_1747 v_main_~y~0_1348) (+ v_main_~x~0_1746 v_main_~y~0_1349)) (< v_main_~x~0_1747 v_main_~x~0_1746)))) InVars {main_~y~0=v_main_~y~0_1349, main_#t~post5=|v_main_#t~post5_233|, main_~x~0=v_main_~x~0_1747, main_#t~post6=|v_main_#t~post6_496|} OutVars{main_~y~0=v_main_~y~0_1348, main_#t~post5=|v_main_#t~post5_232|, main_~x~0=v_main_~x~0_1746, main_#t~post6=|v_main_#t~post6_492|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32430#(<= main_~x~0 999999)} is VALID [2022-04-15 06:59:11,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {32430#(<= main_~x~0 999999)} [281] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {32424#false} is VALID [2022-04-15 06:59:11,221 INFO L272 TraceCheckUtils]: 12: Hoare triple {32424#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {32424#false} is VALID [2022-04-15 06:59:11,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {32424#false} ~cond := #in~cond; {32424#false} is VALID [2022-04-15 06:59:11,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {32424#false} assume 0 == ~cond; {32424#false} is VALID [2022-04-15 06:59:11,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {32424#false} assume !false; {32424#false} is VALID [2022-04-15 06:59:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:59:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:11,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572632004] [2022-04-15 06:59:11,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572632004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:11,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710575979] [2022-04-15 06:59:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:11,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:11,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:11,223 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:59:11,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 06:59:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:11,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:59:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:11,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:11,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {32423#true} call ULTIMATE.init(); {32423#true} is VALID [2022-04-15 06:59:11,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {32423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32423#true} is VALID [2022-04-15 06:59:11,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {32423#true} assume true; {32423#true} is VALID [2022-04-15 06:59:11,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32423#true} {32423#true} #48#return; {32423#true} is VALID [2022-04-15 06:59:11,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {32423#true} call #t~ret7 := main(); {32423#true} is VALID [2022-04-15 06:59:11,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {32423#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {32428#(= main_~x~0 0)} is VALID [2022-04-15 06:59:11,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {32428#(= main_~x~0 0)} [282] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_275| |v_main_#t~post4_274|)) (.cse1 (= v_main_~x~0_1743 v_main_~x~0_1742))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1743 500000)) .cse0 .cse1) (and (< v_main_~x~0_1742 500001) (< v_main_~x~0_1743 v_main_~x~0_1742)))) InVars {main_~x~0=v_main_~x~0_1743, main_#t~post4=|v_main_#t~post4_275|} OutVars{main_~x~0=v_main_~x~0_1742, main_#t~post4=|v_main_#t~post4_274|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:59:11,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [283] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:59:11,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [284] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1745)) (.cse1 (= v_main_~x~0_1745 v_main_~x~0_1744)) (.cse2 (= v_main_~y~0_1347 v_main_~y~0_1346)) (.cse3 (= |v_main_#t~post6_493| |v_main_#t~post6_491|))) (or (and (< v_main_~y~0_1347 v_main_~y~0_1346) (< v_main_~y~0_1346 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1745)) 2) 2 v_main_~y~0_1347)) .cse0 (= (+ v_main_~x~0_1745 (* 2 v_main_~y~0_1346)) (+ v_main_~x~0_1744 (* 2 v_main_~y~0_1347)))) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1745 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1347, main_~x~0=v_main_~x~0_1745, main_#t~post6=|v_main_#t~post6_493|} OutVars{main_~y~0=v_main_~y~0_1346, main_~x~0=v_main_~x~0_1744, main_#t~post6=|v_main_#t~post6_491|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:59:11,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [285] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} is VALID [2022-04-15 06:59:11,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {32453#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)))} [286] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1349 v_main_~y~0_1348)) (.cse1 (= |v_main_#t~post5_233| |v_main_#t~post5_232|)) (.cse2 (= v_main_~x~0_1747 v_main_~x~0_1746)) (.cse3 (= |v_main_#t~post6_496| |v_main_#t~post6_492|)) (.cse4 (<= 500000 v_main_~x~0_1747))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1747 750000)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (< v_main_~x~0_1746 750001) (= (+ v_main_~x~0_1747 v_main_~y~0_1348) (+ v_main_~x~0_1746 v_main_~y~0_1349)) (< v_main_~x~0_1747 v_main_~x~0_1746)))) InVars {main_~y~0=v_main_~y~0_1349, main_#t~post5=|v_main_#t~post5_233|, main_~x~0=v_main_~x~0_1747, main_#t~post6=|v_main_#t~post6_496|} OutVars{main_~y~0=v_main_~y~0_1348, main_#t~post5=|v_main_#t~post5_232|, main_~x~0=v_main_~x~0_1746, main_#t~post6=|v_main_#t~post6_492|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32466#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} is VALID [2022-04-15 06:59:11,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {32466#(or (= main_~x~0 0) (and (< main_~x~0 500001) (< 0 main_~x~0)) (and (< main_~x~0 750001) (< 500000 main_~x~0)))} [281] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {32424#false} is VALID [2022-04-15 06:59:11,498 INFO L272 TraceCheckUtils]: 12: Hoare triple {32424#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {32424#false} is VALID [2022-04-15 06:59:11,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {32424#false} ~cond := #in~cond; {32424#false} is VALID [2022-04-15 06:59:11,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {32424#false} assume 0 == ~cond; {32424#false} is VALID [2022-04-15 06:59:11,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {32424#false} assume !false; {32424#false} is VALID [2022-04-15 06:59:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:11,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:11,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {32424#false} assume !false; {32424#false} is VALID [2022-04-15 06:59:11,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {32485#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32424#false} is VALID [2022-04-15 06:59:11,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {32489#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32485#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:11,882 INFO L272 TraceCheckUtils]: 12: Hoare triple {32493#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {32489#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:11,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {32497#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [281] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {32493#(= main_~x~0 1000000)} is VALID [2022-04-15 06:59:11,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {32497#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [286] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1349 v_main_~y~0_1348)) (.cse1 (= |v_main_#t~post5_233| |v_main_#t~post5_232|)) (.cse2 (= v_main_~x~0_1747 v_main_~x~0_1746)) (.cse3 (= |v_main_#t~post6_496| |v_main_#t~post6_492|)) (.cse4 (<= 500000 v_main_~x~0_1747))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1747 750000)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (< v_main_~x~0_1746 750001) (= (+ v_main_~x~0_1747 v_main_~y~0_1348) (+ v_main_~x~0_1746 v_main_~y~0_1349)) (< v_main_~x~0_1747 v_main_~x~0_1746)))) InVars {main_~y~0=v_main_~y~0_1349, main_#t~post5=|v_main_#t~post5_233|, main_~x~0=v_main_~x~0_1747, main_#t~post6=|v_main_#t~post6_496|} OutVars{main_~y~0=v_main_~y~0_1348, main_#t~post5=|v_main_#t~post5_232|, main_~x~0=v_main_~x~0_1746, main_#t~post6=|v_main_#t~post6_492|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32497#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:59:11,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {32497#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [285] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32497#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:59:11,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {32507#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [284] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1745)) (.cse1 (= v_main_~x~0_1745 v_main_~x~0_1744)) (.cse2 (= v_main_~y~0_1347 v_main_~y~0_1346)) (.cse3 (= |v_main_#t~post6_493| |v_main_#t~post6_491|))) (or (and (< v_main_~y~0_1347 v_main_~y~0_1346) (< v_main_~y~0_1346 (+ (div (+ 999999 (* (- 1) v_main_~x~0_1745)) 2) 2 v_main_~y~0_1347)) .cse0 (= (+ v_main_~x~0_1745 (* 2 v_main_~y~0_1346)) (+ v_main_~x~0_1744 (* 2 v_main_~y~0_1347)))) (and .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1745 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1347, main_~x~0=v_main_~x~0_1745, main_#t~post6=|v_main_#t~post6_493|} OutVars{main_~y~0=v_main_~y~0_1346, main_~x~0=v_main_~x~0_1744, main_#t~post6=|v_main_#t~post6_491|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {32497#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:59:11,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {32507#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [283] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32507#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:59:11,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {32507#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [282] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_275| |v_main_#t~post4_274|)) (.cse1 (= v_main_~x~0_1743 v_main_~x~0_1742))) (or (and .cse0 .cse1) (and (not (< v_main_~x~0_1743 500000)) .cse0 .cse1) (and (< v_main_~x~0_1742 500001) (< v_main_~x~0_1743 v_main_~x~0_1742)))) InVars {main_~x~0=v_main_~x~0_1743, main_#t~post4=|v_main_#t~post4_275|} OutVars{main_~x~0=v_main_~x~0_1742, main_#t~post4=|v_main_#t~post4_274|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32507#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:59:11,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {32423#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {32507#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 06:59:11,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {32423#true} call #t~ret7 := main(); {32423#true} is VALID [2022-04-15 06:59:11,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32423#true} {32423#true} #48#return; {32423#true} is VALID [2022-04-15 06:59:11,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {32423#true} assume true; {32423#true} is VALID [2022-04-15 06:59:11,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {32423#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {32423#true} is VALID [2022-04-15 06:59:11,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {32423#true} call ULTIMATE.init(); {32423#true} is VALID [2022-04-15 06:59:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710575979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:11,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:11,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 13 [2022-04-15 06:59:13,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:13,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598775271] [2022-04-15 06:59:13,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598775271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:13,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:13,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 06:59:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716029307] [2022-04-15 06:59:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2022-04-15 06:59:13,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:13,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:13,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:13,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 06:59:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:13,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 06:59:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2567, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:59:13,598 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:26,421 INFO L93 Difference]: Finished difference Result 203 states and 212 transitions. [2022-04-15 06:59:26,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 06:59:26,421 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2022-04-15 06:59:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 192 transitions. [2022-04-15 06:59:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 192 transitions. [2022-04-15 06:59:26,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 192 transitions. [2022-04-15 06:59:26,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:26,573 INFO L225 Difference]: With dead ends: 203 [2022-04-15 06:59:26,573 INFO L226 Difference]: Without dead ends: 185 [2022-04-15 06:59:26,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=640, Invalid=8480, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:59:26,574 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 131 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 6892 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 6937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 6892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:26,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 258 Invalid, 6937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 6892 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 06:59:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-15 06:59:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2022-04-15 06:59:29,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:29,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 180 states, 175 states have (on average 1.0285714285714285) internal successors, (180), 175 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,396 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 180 states, 175 states have (on average 1.0285714285714285) internal successors, (180), 175 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,396 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 180 states, 175 states have (on average 1.0285714285714285) internal successors, (180), 175 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:29,397 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2022-04-15 06:59:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2022-04-15 06:59:29,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:29,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:29,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 175 states have (on average 1.0285714285714285) internal successors, (180), 175 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-15 06:59:29,398 INFO L87 Difference]: Start difference. First operand has 180 states, 175 states have (on average 1.0285714285714285) internal successors, (180), 175 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-15 06:59:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:29,399 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2022-04-15 06:59:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 189 transitions. [2022-04-15 06:59:29,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:29,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:29,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:29,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.0285714285714285) internal successors, (180), 175 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2022-04-15 06:59:29,401 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 184 transitions. Word has length 173 [2022-04-15 06:59:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:29,401 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 184 transitions. [2022-04-15 06:59:29,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.7555555555555555) internal successors, (169), 44 states have internal predecessors, (169), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:29,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 184 transitions. [2022-04-15 06:59:29,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 184 transitions. [2022-04-15 06:59:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-04-15 06:59:29,849 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:29,849 INFO L499 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:29,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:30,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:30,052 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:30,052 INFO L85 PathProgramCache]: Analyzing trace with hash -311650760, now seen corresponding path program 39 times [2022-04-15 06:59:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:30,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1195046989] [2022-04-15 06:59:34,130 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:34,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:37,287 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:59:37,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:37,655 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:37,656 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1550482023, now seen corresponding path program 1 times [2022-04-15 06:59:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:37,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642207796] [2022-04-15 06:59:37,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:37,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:37,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {33803#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33795#true} is VALID [2022-04-15 06:59:37,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {33795#true} assume true; {33795#true} is VALID [2022-04-15 06:59:37,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33795#true} {33795#true} #48#return; {33795#true} is VALID [2022-04-15 06:59:37,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {33795#true} call ULTIMATE.init(); {33803#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:37,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {33803#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33795#true} is VALID [2022-04-15 06:59:37,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {33795#true} assume true; {33795#true} is VALID [2022-04-15 06:59:37,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33795#true} {33795#true} #48#return; {33795#true} is VALID [2022-04-15 06:59:37,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {33795#true} call #t~ret7 := main(); {33795#true} is VALID [2022-04-15 06:59:37,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {33795#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33800#(= main_~x~0 0)} is VALID [2022-04-15 06:59:37,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {33800#(= main_~x~0 0)} [288] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1808 v_main_~x~0_1807)) (.cse1 (= |v_main_#t~post4_282| |v_main_#t~post4_281|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1808)) (and (< v_main_~x~0_1808 v_main_~x~0_1807) (< v_main_~x~0_1807 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1808, main_#t~post4=|v_main_#t~post4_282|} OutVars{main_~x~0=v_main_~x~0_1807, main_#t~post4=|v_main_#t~post4_281|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {33801#(<= main_~x~0 500000)} [289] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {33801#(<= main_~x~0 500000)} [290] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1810)) (.cse1 (= v_main_~y~0_1402 v_main_~y~0_1401)) (.cse2 (= |v_main_#t~post6_506| |v_main_#t~post6_504|))) (or (and .cse0 (< v_main_~y~0_1402 v_main_~y~0_1401) (< v_main_~y~0_1401 (+ 2 (div (+ (* (- 1) v_main_~x~0_1810) 999999) 2) v_main_~y~0_1402)) (= (+ v_main_~x~0_1810 (* 2 v_main_~y~0_1401)) (+ v_main_~x~0_1809 (* 2 v_main_~y~0_1402)))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1810 1000000))) .cse2 (= v_main_~x~0_1809 v_main_~x~0_1810)) (and .cse1 .cse2 (= v_main_~x~0_1810 v_main_~x~0_1809)))) InVars {main_~y~0=v_main_~y~0_1402, main_~x~0=v_main_~x~0_1810, main_#t~post6=|v_main_#t~post6_506|} OutVars{main_~y~0=v_main_~y~0_1401, main_~x~0=v_main_~x~0_1809, main_#t~post6=|v_main_#t~post6_504|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {33801#(<= main_~x~0 500000)} [291] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {33801#(<= main_~x~0 500000)} [292] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_509| |v_main_#t~post6_505|)) (.cse1 (= v_main_~y~0_1404 v_main_~y~0_1403)) (.cse2 (= |v_main_#t~post5_239| |v_main_#t~post5_238|)) (.cse3 (= v_main_~x~0_1812 v_main_~x~0_1811)) (.cse4 (<= 500000 v_main_~x~0_1812))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1812 750000)) (not .cse4)) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1812 v_main_~y~0_1403))) (and .cse4 (= .cse5 (+ v_main_~x~0_1811 v_main_~y~0_1404)) (< v_main_~y~0_1404 v_main_~y~0_1403) (< .cse5 (+ 750001 v_main_~y~0_1404)))))) InVars {main_~y~0=v_main_~y~0_1404, main_#t~post5=|v_main_#t~post5_239|, main_~x~0=v_main_~x~0_1812, main_#t~post6=|v_main_#t~post6_509|} OutVars{main_~y~0=v_main_~y~0_1403, main_#t~post5=|v_main_#t~post5_238|, main_~x~0=v_main_~x~0_1811, main_#t~post6=|v_main_#t~post6_505|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33802#(<= main_~x~0 750000)} is VALID [2022-04-15 06:59:37,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {33802#(<= main_~x~0 750000)} [287] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {33796#false} is VALID [2022-04-15 06:59:37,714 INFO L272 TraceCheckUtils]: 12: Hoare triple {33796#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {33796#false} is VALID [2022-04-15 06:59:37,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {33796#false} ~cond := #in~cond; {33796#false} is VALID [2022-04-15 06:59:37,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {33796#false} assume 0 == ~cond; {33796#false} is VALID [2022-04-15 06:59:37,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {33796#false} assume !false; {33796#false} is VALID [2022-04-15 06:59:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:37,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642207796] [2022-04-15 06:59:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642207796] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142615658] [2022-04-15 06:59:37,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:37,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:37,724 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:59:37,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 06:59:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:37,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:59:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:37,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:37,947 INFO L272 TraceCheckUtils]: 0: Hoare triple {33795#true} call ULTIMATE.init(); {33795#true} is VALID [2022-04-15 06:59:37,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {33795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33795#true} is VALID [2022-04-15 06:59:37,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {33795#true} assume true; {33795#true} is VALID [2022-04-15 06:59:37,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33795#true} {33795#true} #48#return; {33795#true} is VALID [2022-04-15 06:59:37,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {33795#true} call #t~ret7 := main(); {33795#true} is VALID [2022-04-15 06:59:37,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {33795#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33822#(<= main_~x~0 0)} is VALID [2022-04-15 06:59:37,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {33822#(<= main_~x~0 0)} [288] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1808 v_main_~x~0_1807)) (.cse1 (= |v_main_#t~post4_282| |v_main_#t~post4_281|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1808)) (and (< v_main_~x~0_1808 v_main_~x~0_1807) (< v_main_~x~0_1807 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1808, main_#t~post4=|v_main_#t~post4_282|} OutVars{main_~x~0=v_main_~x~0_1807, main_#t~post4=|v_main_#t~post4_281|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {33801#(<= main_~x~0 500000)} [289] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {33801#(<= main_~x~0 500000)} [290] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1810)) (.cse1 (= v_main_~y~0_1402 v_main_~y~0_1401)) (.cse2 (= |v_main_#t~post6_506| |v_main_#t~post6_504|))) (or (and .cse0 (< v_main_~y~0_1402 v_main_~y~0_1401) (< v_main_~y~0_1401 (+ 2 (div (+ (* (- 1) v_main_~x~0_1810) 999999) 2) v_main_~y~0_1402)) (= (+ v_main_~x~0_1810 (* 2 v_main_~y~0_1401)) (+ v_main_~x~0_1809 (* 2 v_main_~y~0_1402)))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1810 1000000))) .cse2 (= v_main_~x~0_1809 v_main_~x~0_1810)) (and .cse1 .cse2 (= v_main_~x~0_1810 v_main_~x~0_1809)))) InVars {main_~y~0=v_main_~y~0_1402, main_~x~0=v_main_~x~0_1810, main_#t~post6=|v_main_#t~post6_506|} OutVars{main_~y~0=v_main_~y~0_1401, main_~x~0=v_main_~x~0_1809, main_#t~post6=|v_main_#t~post6_504|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {33801#(<= main_~x~0 500000)} [291] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33801#(<= main_~x~0 500000)} is VALID [2022-04-15 06:59:37,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {33801#(<= main_~x~0 500000)} [292] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_509| |v_main_#t~post6_505|)) (.cse1 (= v_main_~y~0_1404 v_main_~y~0_1403)) (.cse2 (= |v_main_#t~post5_239| |v_main_#t~post5_238|)) (.cse3 (= v_main_~x~0_1812 v_main_~x~0_1811)) (.cse4 (<= 500000 v_main_~x~0_1812))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1812 750000)) (not .cse4)) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1812 v_main_~y~0_1403))) (and .cse4 (= .cse5 (+ v_main_~x~0_1811 v_main_~y~0_1404)) (< v_main_~y~0_1404 v_main_~y~0_1403) (< .cse5 (+ 750001 v_main_~y~0_1404)))))) InVars {main_~y~0=v_main_~y~0_1404, main_#t~post5=|v_main_#t~post5_239|, main_~x~0=v_main_~x~0_1812, main_#t~post6=|v_main_#t~post6_509|} OutVars{main_~y~0=v_main_~y~0_1403, main_#t~post5=|v_main_#t~post5_238|, main_~x~0=v_main_~x~0_1811, main_#t~post6=|v_main_#t~post6_505|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33802#(<= main_~x~0 750000)} is VALID [2022-04-15 06:59:37,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {33802#(<= main_~x~0 750000)} [287] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {33796#false} is VALID [2022-04-15 06:59:37,953 INFO L272 TraceCheckUtils]: 12: Hoare triple {33796#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {33796#false} is VALID [2022-04-15 06:59:37,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {33796#false} ~cond := #in~cond; {33796#false} is VALID [2022-04-15 06:59:37,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {33796#false} assume 0 == ~cond; {33796#false} is VALID [2022-04-15 06:59:37,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {33796#false} assume !false; {33796#false} is VALID [2022-04-15 06:59:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:37,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:50,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {33796#false} assume !false; {33796#false} is VALID [2022-04-15 06:59:50,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {33856#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33796#false} is VALID [2022-04-15 06:59:50,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {33860#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33856#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:59:50,644 INFO L272 TraceCheckUtils]: 12: Hoare triple {33864#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {33860#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:59:50,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {33868#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [287] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {33864#(= main_~x~0 1000000)} is VALID [2022-04-15 06:59:50,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {33868#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [292] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_509| |v_main_#t~post6_505|)) (.cse1 (= v_main_~y~0_1404 v_main_~y~0_1403)) (.cse2 (= |v_main_#t~post5_239| |v_main_#t~post5_238|)) (.cse3 (= v_main_~x~0_1812 v_main_~x~0_1811)) (.cse4 (<= 500000 v_main_~x~0_1812))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1812 750000)) (not .cse4)) .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1812 v_main_~y~0_1403))) (and .cse4 (= .cse5 (+ v_main_~x~0_1811 v_main_~y~0_1404)) (< v_main_~y~0_1404 v_main_~y~0_1403) (< .cse5 (+ 750001 v_main_~y~0_1404)))))) InVars {main_~y~0=v_main_~y~0_1404, main_#t~post5=|v_main_#t~post5_239|, main_~x~0=v_main_~x~0_1812, main_#t~post6=|v_main_#t~post6_509|} OutVars{main_~y~0=v_main_~y~0_1403, main_#t~post5=|v_main_#t~post5_238|, main_~x~0=v_main_~x~0_1811, main_#t~post6=|v_main_#t~post6_505|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33868#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:59:50,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {33868#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [291] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33868#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:59:50,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {33878#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [290] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1810)) (.cse1 (= v_main_~y~0_1402 v_main_~y~0_1401)) (.cse2 (= |v_main_#t~post6_506| |v_main_#t~post6_504|))) (or (and .cse0 (< v_main_~y~0_1402 v_main_~y~0_1401) (< v_main_~y~0_1401 (+ 2 (div (+ (* (- 1) v_main_~x~0_1810) 999999) 2) v_main_~y~0_1402)) (= (+ v_main_~x~0_1810 (* 2 v_main_~y~0_1401)) (+ v_main_~x~0_1809 (* 2 v_main_~y~0_1402)))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_1810 1000000))) .cse2 (= v_main_~x~0_1809 v_main_~x~0_1810)) (and .cse1 .cse2 (= v_main_~x~0_1810 v_main_~x~0_1809)))) InVars {main_~y~0=v_main_~y~0_1402, main_~x~0=v_main_~x~0_1810, main_#t~post6=|v_main_#t~post6_506|} OutVars{main_~y~0=v_main_~y~0_1401, main_~x~0=v_main_~x~0_1809, main_#t~post6=|v_main_#t~post6_504|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {33868#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 06:59:50,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {33878#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [289] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33878#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:59:50,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {33878#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [288] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1808 v_main_~x~0_1807)) (.cse1 (= |v_main_#t~post4_282| |v_main_#t~post4_281|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1808)) (and (< v_main_~x~0_1808 v_main_~x~0_1807) (< v_main_~x~0_1807 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1808, main_#t~post4=|v_main_#t~post4_282|} OutVars{main_~x~0=v_main_~x~0_1807, main_#t~post4=|v_main_#t~post4_281|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33878#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:59:50,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {33795#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33878#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 06:59:50,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {33795#true} call #t~ret7 := main(); {33795#true} is VALID [2022-04-15 06:59:50,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33795#true} {33795#true} #48#return; {33795#true} is VALID [2022-04-15 06:59:50,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {33795#true} assume true; {33795#true} is VALID [2022-04-15 06:59:50,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {33795#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {33795#true} is VALID [2022-04-15 06:59:50,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {33795#true} call ULTIMATE.init(); {33795#true} is VALID [2022-04-15 06:59:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:50,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142615658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:50,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:50,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 06:59:52,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1195046989] [2022-04-15 06:59:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1195046989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:52,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:59:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320457468] [2022-04-15 06:59:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:52,312 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 177 [2022-04-15 06:59:52,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:52,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:59:52,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:52,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:59:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:59:52,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2710, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:59:52,432 INFO L87 Difference]: Start difference. First operand 180 states and 184 transitions. Second operand has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:06,290 INFO L93 Difference]: Finished difference Result 207 states and 216 transitions. [2022-04-15 07:00:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 07:00:06,290 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 177 [2022-04-15 07:00:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 196 transitions. [2022-04-15 07:00:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 196 transitions. [2022-04-15 07:00:06,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 196 transitions. [2022-04-15 07:00:06,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:06,443 INFO L225 Difference]: With dead ends: 207 [2022-04-15 07:00:06,443 INFO L226 Difference]: Without dead ends: 189 [2022-04-15 07:00:06,444 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=570, Invalid=8936, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 07:00:06,444 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 7397 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 7443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 7397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:06,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 269 Invalid, 7443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 7397 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 07:00:06,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-15 07:00:09,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2022-04-15 07:00:09,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:09,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 184 states, 179 states have (on average 1.0279329608938548) internal successors, (184), 179 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:09,431 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 184 states, 179 states have (on average 1.0279329608938548) internal successors, (184), 179 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:09,431 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 184 states, 179 states have (on average 1.0279329608938548) internal successors, (184), 179 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:09,433 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-15 07:00:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-15 07:00:09,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:09,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:09,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 179 states have (on average 1.0279329608938548) internal successors, (184), 179 states have internal predecessors, (184), 3 states have call successors, (3), 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 189 states. [2022-04-15 07:00:09,433 INFO L87 Difference]: Start difference. First operand has 184 states, 179 states have (on average 1.0279329608938548) internal successors, (184), 179 states have internal predecessors, (184), 3 states have call successors, (3), 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 189 states. [2022-04-15 07:00:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:09,436 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-15 07:00:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-15 07:00:09,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:09,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:09,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:09,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.0279329608938548) internal successors, (184), 179 states have internal predecessors, (184), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 188 transitions. [2022-04-15 07:00:09,439 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 188 transitions. Word has length 177 [2022-04-15 07:00:09,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:09,439 INFO L478 AbstractCegarLoop]: Abstraction has 184 states and 188 transitions. [2022-04-15 07:00:09,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.760869565217391) internal successors, (173), 45 states have internal predecessors, (173), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:09,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 188 transitions. [2022-04-15 07:00:09,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2022-04-15 07:00:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-04-15 07:00:09,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:09,908 INFO L499 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:09,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 07:00:10,109 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-15 07:00:10,109 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:10,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1232769423, now seen corresponding path program 40 times [2022-04-15 07:00:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:10,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619447062] [2022-04-15 07:00:10,221 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:10,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:10,736 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:10,737 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1190907047, now seen corresponding path program 1 times [2022-04-15 07:00:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:10,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349196271] [2022-04-15 07:00:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:10,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:10,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {35202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35194#true} is VALID [2022-04-15 07:00:10,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {35194#true} assume true; {35194#true} is VALID [2022-04-15 07:00:10,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35194#true} {35194#true} #48#return; {35194#true} is VALID [2022-04-15 07:00:10,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {35194#true} call ULTIMATE.init(); {35202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:10,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {35202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35194#true} is VALID [2022-04-15 07:00:10,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {35194#true} assume true; {35194#true} is VALID [2022-04-15 07:00:10,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35194#true} {35194#true} #48#return; {35194#true} is VALID [2022-04-15 07:00:10,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {35194#true} call #t~ret7 := main(); {35194#true} is VALID [2022-04-15 07:00:10,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {35194#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35199#(= main_~x~0 0)} is VALID [2022-04-15 07:00:10,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {35199#(= main_~x~0 0)} [294] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_289| |v_main_#t~post4_288|)) (.cse1 (= v_main_~x~0_1874 v_main_~x~0_1873))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1874 500000))) (and (< v_main_~x~0_1873 500001) (< v_main_~x~0_1874 v_main_~x~0_1873)))) InVars {main_~x~0=v_main_~x~0_1874, main_#t~post4=|v_main_#t~post4_289|} OutVars{main_~x~0=v_main_~x~0_1873, main_#t~post4=|v_main_#t~post4_288|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {35200#(<= main_~x~0 500000)} [295] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {35200#(<= main_~x~0 500000)} [296] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1458 v_main_~y~0_1457)) (.cse1 (= v_main_~x~0_1876 v_main_~x~0_1875)) (.cse2 (= |v_main_#t~post6_519| |v_main_#t~post6_517|)) (.cse3 (<= 750000 v_main_~x~0_1876))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1876 1000000)) (not .cse3))) (and .cse0 .cse1 .cse2) (and (< v_main_~y~0_1458 v_main_~y~0_1457) (< v_main_~y~0_1457 (+ (div (+ (* (- 1) v_main_~x~0_1876) 999999) 2) 2 v_main_~y~0_1458)) .cse3 (= (+ v_main_~x~0_1876 (* 2 v_main_~y~0_1457)) (+ v_main_~x~0_1875 (* 2 v_main_~y~0_1458)))))) InVars {main_~y~0=v_main_~y~0_1458, main_~x~0=v_main_~x~0_1876, main_#t~post6=|v_main_#t~post6_519|} OutVars{main_~y~0=v_main_~y~0_1457, main_~x~0=v_main_~x~0_1875, main_#t~post6=|v_main_#t~post6_517|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {35200#(<= main_~x~0 500000)} [297] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {35200#(<= main_~x~0 500000)} [298] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1878)) (.cse1 (= |v_main_#t~post5_245| |v_main_#t~post5_244|)) (.cse2 (= v_main_~x~0_1878 v_main_~x~0_1877)) (.cse3 (= v_main_~y~0_1460 v_main_~y~0_1459))) (or (and (< v_main_~x~0_1877 750001) (< v_main_~x~0_1878 v_main_~x~0_1877) .cse0 (= (+ v_main_~x~0_1878 v_main_~y~0_1459) (+ v_main_~x~0_1877 v_main_~y~0_1460))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_522| |v_main_#t~post6_518|)) (and (or (not .cse0) (not (< v_main_~x~0_1878 750000))) .cse1 (= |v_main_#t~post6_518| |v_main_#t~post6_522|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1460, main_#t~post5=|v_main_#t~post5_245|, main_~x~0=v_main_~x~0_1878, main_#t~post6=|v_main_#t~post6_522|} OutVars{main_~y~0=v_main_~y~0_1459, main_#t~post5=|v_main_#t~post5_244|, main_~x~0=v_main_~x~0_1877, main_#t~post6=|v_main_#t~post6_518|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35201#(<= main_~x~0 750000)} is VALID [2022-04-15 07:00:10,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {35201#(<= main_~x~0 750000)} [293] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {35195#false} is VALID [2022-04-15 07:00:10,793 INFO L272 TraceCheckUtils]: 12: Hoare triple {35195#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {35195#false} is VALID [2022-04-15 07:00:10,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {35195#false} ~cond := #in~cond; {35195#false} is VALID [2022-04-15 07:00:10,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {35195#false} assume 0 == ~cond; {35195#false} is VALID [2022-04-15 07:00:10,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {35195#false} assume !false; {35195#false} is VALID [2022-04-15 07:00:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:10,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:10,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349196271] [2022-04-15 07:00:10,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349196271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:10,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816086328] [2022-04-15 07:00:10,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:10,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:10,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:10,795 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:00:10,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 07:00:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:10,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:00:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:10,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:10,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {35194#true} call ULTIMATE.init(); {35194#true} is VALID [2022-04-15 07:00:10,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {35194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35194#true} is VALID [2022-04-15 07:00:10,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {35194#true} assume true; {35194#true} is VALID [2022-04-15 07:00:10,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35194#true} {35194#true} #48#return; {35194#true} is VALID [2022-04-15 07:00:10,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {35194#true} call #t~ret7 := main(); {35194#true} is VALID [2022-04-15 07:00:10,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {35194#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35221#(<= main_~x~0 0)} is VALID [2022-04-15 07:00:10,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {35221#(<= main_~x~0 0)} [294] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_289| |v_main_#t~post4_288|)) (.cse1 (= v_main_~x~0_1874 v_main_~x~0_1873))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1874 500000))) (and (< v_main_~x~0_1873 500001) (< v_main_~x~0_1874 v_main_~x~0_1873)))) InVars {main_~x~0=v_main_~x~0_1874, main_#t~post4=|v_main_#t~post4_289|} OutVars{main_~x~0=v_main_~x~0_1873, main_#t~post4=|v_main_#t~post4_288|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {35200#(<= main_~x~0 500000)} [295] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {35200#(<= main_~x~0 500000)} [296] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1458 v_main_~y~0_1457)) (.cse1 (= v_main_~x~0_1876 v_main_~x~0_1875)) (.cse2 (= |v_main_#t~post6_519| |v_main_#t~post6_517|)) (.cse3 (<= 750000 v_main_~x~0_1876))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1876 1000000)) (not .cse3))) (and .cse0 .cse1 .cse2) (and (< v_main_~y~0_1458 v_main_~y~0_1457) (< v_main_~y~0_1457 (+ (div (+ (* (- 1) v_main_~x~0_1876) 999999) 2) 2 v_main_~y~0_1458)) .cse3 (= (+ v_main_~x~0_1876 (* 2 v_main_~y~0_1457)) (+ v_main_~x~0_1875 (* 2 v_main_~y~0_1458)))))) InVars {main_~y~0=v_main_~y~0_1458, main_~x~0=v_main_~x~0_1876, main_#t~post6=|v_main_#t~post6_519|} OutVars{main_~y~0=v_main_~y~0_1457, main_~x~0=v_main_~x~0_1875, main_#t~post6=|v_main_#t~post6_517|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {35200#(<= main_~x~0 500000)} [297] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35200#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:10,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {35200#(<= main_~x~0 500000)} [298] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1878)) (.cse1 (= |v_main_#t~post5_245| |v_main_#t~post5_244|)) (.cse2 (= v_main_~x~0_1878 v_main_~x~0_1877)) (.cse3 (= v_main_~y~0_1460 v_main_~y~0_1459))) (or (and (< v_main_~x~0_1877 750001) (< v_main_~x~0_1878 v_main_~x~0_1877) .cse0 (= (+ v_main_~x~0_1878 v_main_~y~0_1459) (+ v_main_~x~0_1877 v_main_~y~0_1460))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_522| |v_main_#t~post6_518|)) (and (or (not .cse0) (not (< v_main_~x~0_1878 750000))) .cse1 (= |v_main_#t~post6_518| |v_main_#t~post6_522|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1460, main_#t~post5=|v_main_#t~post5_245|, main_~x~0=v_main_~x~0_1878, main_#t~post6=|v_main_#t~post6_522|} OutVars{main_~y~0=v_main_~y~0_1459, main_#t~post5=|v_main_#t~post5_244|, main_~x~0=v_main_~x~0_1877, main_#t~post6=|v_main_#t~post6_518|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35201#(<= main_~x~0 750000)} is VALID [2022-04-15 07:00:10,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {35201#(<= main_~x~0 750000)} [293] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {35195#false} is VALID [2022-04-15 07:00:10,992 INFO L272 TraceCheckUtils]: 12: Hoare triple {35195#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {35195#false} is VALID [2022-04-15 07:00:10,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {35195#false} ~cond := #in~cond; {35195#false} is VALID [2022-04-15 07:00:10,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {35195#false} assume 0 == ~cond; {35195#false} is VALID [2022-04-15 07:00:10,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {35195#false} assume !false; {35195#false} is VALID [2022-04-15 07:00:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:10,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:11,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {35195#false} assume !false; {35195#false} is VALID [2022-04-15 07:00:11,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {35255#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35195#false} is VALID [2022-04-15 07:00:11,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {35259#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35255#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:11,676 INFO L272 TraceCheckUtils]: 12: Hoare triple {35263#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {35259#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:11,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {35267#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [293] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {35263#(= main_~x~0 1000000)} is VALID [2022-04-15 07:00:11,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {35267#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [298] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_1878)) (.cse1 (= |v_main_#t~post5_245| |v_main_#t~post5_244|)) (.cse2 (= v_main_~x~0_1878 v_main_~x~0_1877)) (.cse3 (= v_main_~y~0_1460 v_main_~y~0_1459))) (or (and (< v_main_~x~0_1877 750001) (< v_main_~x~0_1878 v_main_~x~0_1877) .cse0 (= (+ v_main_~x~0_1878 v_main_~y~0_1459) (+ v_main_~x~0_1877 v_main_~y~0_1460))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_522| |v_main_#t~post6_518|)) (and (or (not .cse0) (not (< v_main_~x~0_1878 750000))) .cse1 (= |v_main_#t~post6_518| |v_main_#t~post6_522|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1460, main_#t~post5=|v_main_#t~post5_245|, main_~x~0=v_main_~x~0_1878, main_#t~post6=|v_main_#t~post6_522|} OutVars{main_~y~0=v_main_~y~0_1459, main_#t~post5=|v_main_#t~post5_244|, main_~x~0=v_main_~x~0_1877, main_#t~post6=|v_main_#t~post6_518|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35267#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 07:00:11,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {35267#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [297] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35267#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 07:00:11,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {35277#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [296] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~y~0_1458 v_main_~y~0_1457)) (.cse1 (= v_main_~x~0_1876 v_main_~x~0_1875)) (.cse2 (= |v_main_#t~post6_519| |v_main_#t~post6_517|)) (.cse3 (<= 750000 v_main_~x~0_1876))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1876 1000000)) (not .cse3))) (and .cse0 .cse1 .cse2) (and (< v_main_~y~0_1458 v_main_~y~0_1457) (< v_main_~y~0_1457 (+ (div (+ (* (- 1) v_main_~x~0_1876) 999999) 2) 2 v_main_~y~0_1458)) .cse3 (= (+ v_main_~x~0_1876 (* 2 v_main_~y~0_1457)) (+ v_main_~x~0_1875 (* 2 v_main_~y~0_1458)))))) InVars {main_~y~0=v_main_~y~0_1458, main_~x~0=v_main_~x~0_1876, main_#t~post6=|v_main_#t~post6_519|} OutVars{main_~y~0=v_main_~y~0_1457, main_~x~0=v_main_~x~0_1875, main_#t~post6=|v_main_#t~post6_517|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {35267#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 07:00:11,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {35277#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [295] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35277#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 07:00:11,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {35277#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} [294] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_289| |v_main_#t~post4_288|)) (.cse1 (= v_main_~x~0_1874 v_main_~x~0_1873))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1874 500000))) (and (< v_main_~x~0_1873 500001) (< v_main_~x~0_1874 v_main_~x~0_1873)))) InVars {main_~x~0=v_main_~x~0_1874, main_#t~post4=|v_main_#t~post4_289|} OutVars{main_~x~0=v_main_~x~0_1873, main_#t~post4=|v_main_#t~post4_288|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35277#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 07:00:11,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {35194#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35277#(and (or (<= (+ 2 (div (+ 999999 (* (- 1) main_~x~0)) 2)) (div (+ (- 1000001) main_~x~0) (- 2))) (not (<= 750000 main_~x~0))) (or (< main_~x~0 1000000) (= main_~x~0 1000000)))} is VALID [2022-04-15 07:00:11,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {35194#true} call #t~ret7 := main(); {35194#true} is VALID [2022-04-15 07:00:11,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35194#true} {35194#true} #48#return; {35194#true} is VALID [2022-04-15 07:00:11,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {35194#true} assume true; {35194#true} is VALID [2022-04-15 07:00:11,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {35194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {35194#true} is VALID [2022-04-15 07:00:11,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {35194#true} call ULTIMATE.init(); {35194#true} is VALID [2022-04-15 07:00:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:11,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816086328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:11,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:11,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 07:00:13,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:13,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619447062] [2022-04-15 07:00:13,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619447062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:13,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:13,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 07:00:13,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641984610] [2022-04-15 07:00:13,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2022-04-15 07:00:13,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:13,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:13,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:13,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 07:00:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:13,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 07:00:13,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=2815, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 07:00:13,502 INFO L87 Difference]: Start difference. First operand 184 states and 188 transitions. Second operand has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:27,721 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2022-04-15 07:00:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 07:00:27,722 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 181 [2022-04-15 07:00:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 200 transitions. [2022-04-15 07:00:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 200 transitions. [2022-04-15 07:00:27,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 200 transitions. [2022-04-15 07:00:27,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:27,902 INFO L225 Difference]: With dead ends: 211 [2022-04-15 07:00:27,902 INFO L226 Difference]: Without dead ends: 193 [2022-04-15 07:00:27,903 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=582, Invalid=9318, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 07:00:27,903 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 137 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 7745 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 7792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 7745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:27,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 275 Invalid, 7792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 7745 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 07:00:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-15 07:00:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2022-04-15 07:00:31,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:31,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 188 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 183 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:31,000 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 188 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 183 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:31,001 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 188 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 183 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:31,004 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2022-04-15 07:00:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2022-04-15 07:00:31,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:31,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:31,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 183 states have internal predecessors, (188), 3 states have call successors, (3), 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 193 states. [2022-04-15 07:00:31,004 INFO L87 Difference]: Start difference. First operand has 188 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 183 states have internal predecessors, (188), 3 states have call successors, (3), 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 193 states. [2022-04-15 07:00:31,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:31,006 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2022-04-15 07:00:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2022-04-15 07:00:31,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:31,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:31,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:31,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 183 states have internal predecessors, (188), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 192 transitions. [2022-04-15 07:00:31,009 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 192 transitions. Word has length 181 [2022-04-15 07:00:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:31,009 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 192 transitions. [2022-04-15 07:00:31,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.765957446808511) internal successors, (177), 46 states have internal predecessors, (177), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:31,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 192 transitions. [2022-04-15 07:00:31,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 192 transitions. [2022-04-15 07:00:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-15 07:00:31,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:31,505 INFO L499 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:31,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 07:00:31,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:31,707 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1394800282, now seen corresponding path program 41 times [2022-04-15 07:00:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:31,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344625320] [2022-04-15 07:00:31,812 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:32,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:32,263 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:32,265 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:32,268 INFO L85 PathProgramCache]: Analyzing trace with hash 831332071, now seen corresponding path program 1 times [2022-04-15 07:00:32,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:32,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892940125] [2022-04-15 07:00:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:32,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:32,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:00:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:32,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {36628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36620#true} is VALID [2022-04-15 07:00:32,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {36620#true} assume true; {36620#true} is VALID [2022-04-15 07:00:32,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36620#true} {36620#true} #48#return; {36620#true} is VALID [2022-04-15 07:00:32,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {36620#true} call ULTIMATE.init(); {36628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:00:32,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {36628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36620#true} is VALID [2022-04-15 07:00:32,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {36620#true} assume true; {36620#true} is VALID [2022-04-15 07:00:32,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36620#true} {36620#true} #48#return; {36620#true} is VALID [2022-04-15 07:00:32,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {36620#true} call #t~ret7 := main(); {36620#true} is VALID [2022-04-15 07:00:32,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {36620#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {36625#(= main_~x~0 0)} is VALID [2022-04-15 07:00:32,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {36625#(= main_~x~0 0)} [300] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_296| |v_main_#t~post4_295|)) (.cse1 (= v_main_~x~0_1941 v_main_~x~0_1940))) (or (and (< v_main_~x~0_1940 500001) (< v_main_~x~0_1941 v_main_~x~0_1940)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1941) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1941, main_#t~post4=|v_main_#t~post4_296|} OutVars{main_~x~0=v_main_~x~0_1940, main_#t~post4=|v_main_#t~post4_295|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {36626#(<= main_~x~0 500000)} [301] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {36626#(<= main_~x~0 500000)} [302] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1943)) (.cse1 (= |v_main_#t~post6_532| |v_main_#t~post6_530|)) (.cse2 (= v_main_~x~0_1943 v_main_~x~0_1942)) (.cse3 (= v_main_~y~0_1515 v_main_~y~0_1514))) (or (and (< v_main_~y~0_1514 (+ 2 v_main_~y~0_1515 (div (+ 999999 (* (- 1) v_main_~x~0_1943)) 2))) (< v_main_~y~0_1515 v_main_~y~0_1514) (= (+ (* 2 v_main_~y~0_1514) v_main_~x~0_1943) (+ v_main_~x~0_1942 (* 2 v_main_~y~0_1515))) .cse0) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1943 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1515, main_~x~0=v_main_~x~0_1943, main_#t~post6=|v_main_#t~post6_532|} OutVars{main_~y~0=v_main_~y~0_1514, main_~x~0=v_main_~x~0_1942, main_#t~post6=|v_main_#t~post6_530|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {36626#(<= main_~x~0 500000)} [303] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {36626#(<= main_~x~0 500000)} [304] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1945 v_main_~x~0_1944)) (.cse1 (= |v_main_#t~post6_535| |v_main_#t~post6_531|)) (.cse2 (= |v_main_#t~post5_251| |v_main_#t~post5_250|)) (.cse3 (= v_main_~y~0_1517 v_main_~y~0_1516)) (.cse4 (<= 500000 v_main_~x~0_1945))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1945 750000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1945 v_main_~y~0_1516))) (and (= (+ v_main_~x~0_1944 v_main_~y~0_1517) .cse5) .cse4 (< v_main_~y~0_1517 v_main_~y~0_1516) (< .cse5 (+ 750001 v_main_~y~0_1517)))))) InVars {main_~y~0=v_main_~y~0_1517, main_#t~post5=|v_main_#t~post5_251|, main_~x~0=v_main_~x~0_1945, main_#t~post6=|v_main_#t~post6_535|} OutVars{main_~y~0=v_main_~y~0_1516, main_#t~post5=|v_main_#t~post5_250|, main_~x~0=v_main_~x~0_1944, main_#t~post6=|v_main_#t~post6_531|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36627#(<= main_~x~0 750000)} is VALID [2022-04-15 07:00:32,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {36627#(<= main_~x~0 750000)} [299] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {36621#false} is VALID [2022-04-15 07:00:32,333 INFO L272 TraceCheckUtils]: 12: Hoare triple {36621#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {36621#false} is VALID [2022-04-15 07:00:32,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {36621#false} ~cond := #in~cond; {36621#false} is VALID [2022-04-15 07:00:32,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {36621#false} assume 0 == ~cond; {36621#false} is VALID [2022-04-15 07:00:32,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {36621#false} assume !false; {36621#false} is VALID [2022-04-15 07:00:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:32,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:00:32,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892940125] [2022-04-15 07:00:32,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892940125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:00:32,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942254121] [2022-04-15 07:00:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:32,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:00:32,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:00:32,335 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:00:32,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 07:00:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:32,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 07:00:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:00:32,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:00:32,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {36620#true} call ULTIMATE.init(); {36620#true} is VALID [2022-04-15 07:00:32,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {36620#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36620#true} is VALID [2022-04-15 07:00:32,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {36620#true} assume true; {36620#true} is VALID [2022-04-15 07:00:32,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36620#true} {36620#true} #48#return; {36620#true} is VALID [2022-04-15 07:00:32,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {36620#true} call #t~ret7 := main(); {36620#true} is VALID [2022-04-15 07:00:32,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {36620#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {36647#(<= main_~x~0 0)} is VALID [2022-04-15 07:00:32,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {36647#(<= main_~x~0 0)} [300] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_296| |v_main_#t~post4_295|)) (.cse1 (= v_main_~x~0_1941 v_main_~x~0_1940))) (or (and (< v_main_~x~0_1940 500001) (< v_main_~x~0_1941 v_main_~x~0_1940)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1941) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1941, main_#t~post4=|v_main_#t~post4_296|} OutVars{main_~x~0=v_main_~x~0_1940, main_#t~post4=|v_main_#t~post4_295|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {36626#(<= main_~x~0 500000)} [301] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {36626#(<= main_~x~0 500000)} [302] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1943)) (.cse1 (= |v_main_#t~post6_532| |v_main_#t~post6_530|)) (.cse2 (= v_main_~x~0_1943 v_main_~x~0_1942)) (.cse3 (= v_main_~y~0_1515 v_main_~y~0_1514))) (or (and (< v_main_~y~0_1514 (+ 2 v_main_~y~0_1515 (div (+ 999999 (* (- 1) v_main_~x~0_1943)) 2))) (< v_main_~y~0_1515 v_main_~y~0_1514) (= (+ (* 2 v_main_~y~0_1514) v_main_~x~0_1943) (+ v_main_~x~0_1942 (* 2 v_main_~y~0_1515))) .cse0) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1943 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1515, main_~x~0=v_main_~x~0_1943, main_#t~post6=|v_main_#t~post6_532|} OutVars{main_~y~0=v_main_~y~0_1514, main_~x~0=v_main_~x~0_1942, main_#t~post6=|v_main_#t~post6_530|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {36626#(<= main_~x~0 500000)} [303] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36626#(<= main_~x~0 500000)} is VALID [2022-04-15 07:00:32,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {36626#(<= main_~x~0 500000)} [304] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1945 v_main_~x~0_1944)) (.cse1 (= |v_main_#t~post6_535| |v_main_#t~post6_531|)) (.cse2 (= |v_main_#t~post5_251| |v_main_#t~post5_250|)) (.cse3 (= v_main_~y~0_1517 v_main_~y~0_1516)) (.cse4 (<= 500000 v_main_~x~0_1945))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1945 750000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1945 v_main_~y~0_1516))) (and (= (+ v_main_~x~0_1944 v_main_~y~0_1517) .cse5) .cse4 (< v_main_~y~0_1517 v_main_~y~0_1516) (< .cse5 (+ 750001 v_main_~y~0_1517)))))) InVars {main_~y~0=v_main_~y~0_1517, main_#t~post5=|v_main_#t~post5_251|, main_~x~0=v_main_~x~0_1945, main_#t~post6=|v_main_#t~post6_535|} OutVars{main_~y~0=v_main_~y~0_1516, main_#t~post5=|v_main_#t~post5_250|, main_~x~0=v_main_~x~0_1944, main_#t~post6=|v_main_#t~post6_531|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36627#(<= main_~x~0 750000)} is VALID [2022-04-15 07:00:32,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {36627#(<= main_~x~0 750000)} [299] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {36621#false} is VALID [2022-04-15 07:00:32,508 INFO L272 TraceCheckUtils]: 12: Hoare triple {36621#false} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {36621#false} is VALID [2022-04-15 07:00:32,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {36621#false} ~cond := #in~cond; {36621#false} is VALID [2022-04-15 07:00:32,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {36621#false} assume 0 == ~cond; {36621#false} is VALID [2022-04-15 07:00:32,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {36621#false} assume !false; {36621#false} is VALID [2022-04-15 07:00:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:32,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:00:45,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {36621#false} assume !false; {36621#false} is VALID [2022-04-15 07:00:45,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {36681#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36621#false} is VALID [2022-04-15 07:00:45,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {36685#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {36681#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:00:45,240 INFO L272 TraceCheckUtils]: 12: Hoare triple {36689#(= main_~x~0 1000000)} call __VERIFIER_assert((if 1000000 == ~x~0 then 1 else 0)); {36685#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:00:45,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {36693#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [299] L10-2_primed-->L10-2: Formula: (not (< v_main_~x~0_12 1000000)) InVars {main_~x~0=v_main_~x~0_12} OutVars{main_~x~0=v_main_~x~0_12} AuxVars[] AssignedVars[] {36689#(= main_~x~0 1000000)} is VALID [2022-04-15 07:00:45,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {36693#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [304] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_1945 v_main_~x~0_1944)) (.cse1 (= |v_main_#t~post6_535| |v_main_#t~post6_531|)) (.cse2 (= |v_main_#t~post5_251| |v_main_#t~post5_250|)) (.cse3 (= v_main_~y~0_1517 v_main_~y~0_1516)) (.cse4 (<= 500000 v_main_~x~0_1945))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1945 750000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1945 v_main_~y~0_1516))) (and (= (+ v_main_~x~0_1944 v_main_~y~0_1517) .cse5) .cse4 (< v_main_~y~0_1517 v_main_~y~0_1516) (< .cse5 (+ 750001 v_main_~y~0_1517)))))) InVars {main_~y~0=v_main_~y~0_1517, main_#t~post5=|v_main_#t~post5_251|, main_~x~0=v_main_~x~0_1945, main_#t~post6=|v_main_#t~post6_535|} OutVars{main_~y~0=v_main_~y~0_1516, main_#t~post5=|v_main_#t~post5_250|, main_~x~0=v_main_~x~0_1944, main_#t~post6=|v_main_#t~post6_531|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36693#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 07:00:45,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {36693#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} [303] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36693#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 07:00:45,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {36703#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [302] L11-2-->L10-2_primed: Formula: (let ((.cse0 (<= 750000 v_main_~x~0_1943)) (.cse1 (= |v_main_#t~post6_532| |v_main_#t~post6_530|)) (.cse2 (= v_main_~x~0_1943 v_main_~x~0_1942)) (.cse3 (= v_main_~y~0_1515 v_main_~y~0_1514))) (or (and (< v_main_~y~0_1514 (+ 2 v_main_~y~0_1515 (div (+ 999999 (* (- 1) v_main_~x~0_1943)) 2))) (< v_main_~y~0_1515 v_main_~y~0_1514) (= (+ (* 2 v_main_~y~0_1514) v_main_~x~0_1943) (+ v_main_~x~0_1942 (* 2 v_main_~y~0_1515))) .cse0) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1943 1000000)))) (and .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1515, main_~x~0=v_main_~x~0_1943, main_#t~post6=|v_main_#t~post6_532|} OutVars{main_~y~0=v_main_~y~0_1514, main_~x~0=v_main_~x~0_1942, main_#t~post6=|v_main_#t~post6_530|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post6] {36693#(or (< main_~x~0 1000000) (= main_~x~0 1000000))} is VALID [2022-04-15 07:00:45,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {36703#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [301] L10-2_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36703#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 07:00:45,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {36703#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} [300] L11-2-->L10-2_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_296| |v_main_#t~post4_295|)) (.cse1 (= v_main_~x~0_1941 v_main_~x~0_1940))) (or (and (< v_main_~x~0_1940 500001) (< v_main_~x~0_1941 v_main_~x~0_1940)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1941) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1941, main_#t~post4=|v_main_#t~post4_296|} OutVars{main_~x~0=v_main_~x~0_1940, main_#t~post4=|v_main_#t~post4_295|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {36703#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 07:00:45,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {36620#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {36703#(and (or (< main_~x~0 1000000) (= main_~x~0 1000000)) (or (<= (+ (div (+ 999999 (* (- 1) main_~x~0)) 2) 1) (div (+ 1000000 (* (- 1) main_~x~0)) 2)) (not (<= 750000 main_~x~0))))} is VALID [2022-04-15 07:00:45,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {36620#true} call #t~ret7 := main(); {36620#true} is VALID [2022-04-15 07:00:45,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36620#true} {36620#true} #48#return; {36620#true} is VALID [2022-04-15 07:00:45,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {36620#true} assume true; {36620#true} is VALID [2022-04-15 07:00:45,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {36620#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {36620#true} is VALID [2022-04-15 07:00:45,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {36620#true} call ULTIMATE.init(); {36620#true} is VALID [2022-04-15 07:00:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:00:45,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942254121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:00:45,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 07:00:45,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-04-15 07:00:46,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:00:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344625320] [2022-04-15 07:00:46,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344625320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:00:46,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:00:46,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 07:00:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935359425] [2022-04-15 07:00:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:00:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 185 [2022-04-15 07:00:46,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:00:46,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:00:47,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:47,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 07:00:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 07:00:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2922, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 07:00:47,081 INFO L87 Difference]: Start difference. First operand 188 states and 192 transitions. Second operand has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:02,213 INFO L93 Difference]: Finished difference Result 215 states and 224 transitions. [2022-04-15 07:01:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 07:01:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 185 [2022-04-15 07:01:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:01:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 204 transitions. [2022-04-15 07:01:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 204 transitions. [2022-04-15 07:01:02,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 204 transitions. [2022-04-15 07:01:02,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:02,373 INFO L225 Difference]: With dead ends: 215 [2022-04-15 07:01:02,373 INFO L226 Difference]: Without dead ends: 197 [2022-04-15 07:01:02,374 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=594, Invalid=9708, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 07:01:02,374 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 140 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 8101 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 8149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 8101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:01:02,374 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 281 Invalid, 8149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 8101 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-15 07:01:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-15 07:01:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2022-04-15 07:01:05,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:01:05,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 192 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:05,657 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 192 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:05,657 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 192 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:05,659 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2022-04-15 07:01:05,659 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2022-04-15 07:01:05,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:05,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:05,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 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 197 states. [2022-04-15 07:01:05,660 INFO L87 Difference]: Start difference. First operand has 192 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 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 197 states. [2022-04-15 07:01:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:01:05,661 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2022-04-15 07:01:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2022-04-15 07:01:05,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:01:05,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:01:05,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:01:05,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:01:05,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 196 transitions. [2022-04-15 07:01:05,664 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 196 transitions. Word has length 185 [2022-04-15 07:01:05,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:01:05,664 INFO L478 AbstractCegarLoop]: Abstraction has 192 states and 196 transitions. [2022-04-15 07:01:05,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 47 states have internal predecessors, (181), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:01:05,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 192 states and 196 transitions. [2022-04-15 07:01:06,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:01:06,186 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 196 transitions. [2022-04-15 07:01:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-15 07:01:06,187 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:01:06,187 INFO L499 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:01:06,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 07:01:06,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:01:06,388 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:01:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:01:06,388 INFO L85 PathProgramCache]: Analyzing trace with hash 671202749, now seen corresponding path program 42 times [2022-04-15 07:01:06,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:01:06,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239613696]