/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/nla-digbench-scaling/bresenham-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:35:01,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:35:01,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:35:02,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:35:02,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:35:02,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:35:02,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:35:02,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:35:02,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:35:02,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:35:02,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:35:02,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:35:02,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:35:02,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:35:02,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:35:02,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:35:02,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:35:02,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:35:02,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:35:02,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:35:02,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:35:02,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:35:02,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:35:02,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:35:02,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:35:02,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:35:02,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:35:02,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:35:02,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:35:02,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:35:02,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:35:02,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:35:02,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:35:02,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:35:02,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:35:02,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:35:02,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:35:02,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:35:02,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:35:02,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:35:02,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:35:02,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:35:02,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:35:02,084 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:35:02,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:35:02,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:35:02,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:35:02,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:35:02,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:35:02,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:35:02,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:35:02,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:35:02,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:35:02,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:35:02,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:35:02,087 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:35:02,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:35:02,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:35:02,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:35:02,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:35:02,308 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:35:02,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c [2022-04-28 04:35:02,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881d8992b/0271531c1f1f42a3a08e754563aa34a4/FLAGfafebed00 [2022-04-28 04:35:02,735 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:35:02,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c [2022-04-28 04:35:02,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881d8992b/0271531c1f1f42a3a08e754563aa34a4/FLAGfafebed00 [2022-04-28 04:35:02,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881d8992b/0271531c1f1f42a3a08e754563aa34a4 [2022-04-28 04:35:02,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:35:02,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:35:02,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:35:02,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:35:02,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:35:02,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:02,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379b9b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02, skipping insertion in model container [2022-04-28 04:35:02,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:02,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:35:02,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:35:02,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c[597,610] [2022-04-28 04:35:02,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:35:02,957 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:35:02,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound10.c[597,610] [2022-04-28 04:35:02,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:35:02,996 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:35:02,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02 WrapperNode [2022-04-28 04:35:02,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:35:02,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:35:02,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:35:02,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:35:03,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:35:03,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:35:03,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:35:03,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:35:03,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (1/1) ... [2022-04-28 04:35:03,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:35:03,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:03,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:35:03,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:35:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:35:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:35:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:35:03,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:35:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:35:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:35:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:35:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:35:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:35:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:35:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:35:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:35:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:35:03,135 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:35:03,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:35:03,286 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:35:03,306 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:35:03,306 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:35:03,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:35:03 BoogieIcfgContainer [2022-04-28 04:35:03,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:35:03,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:35:03,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:35:03,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:35:03,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:35:02" (1/3) ... [2022-04-28 04:35:03,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7750ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:35:03, skipping insertion in model container [2022-04-28 04:35:03,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:35:02" (2/3) ... [2022-04-28 04:35:03,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7750ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:35:03, skipping insertion in model container [2022-04-28 04:35:03,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:35:03" (3/3) ... [2022-04-28 04:35:03,312 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound10.c [2022-04-28 04:35:03,321 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:35:03,321 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:35:03,360 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:35:03,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a68de7e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@141bda8a [2022-04-28 04:35:03,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:35:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:35:03,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:03,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:03,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-28 04:35:03,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:03,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497408156] [2022-04-28 04:35:03,399 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-28 04:35:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:03,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656401274] [2022-04-28 04:35:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:35:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:03,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-28 04:35:03,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 04:35:03,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-28 04:35:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:35:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:03,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 04:35:03,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 04:35:03,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 04:35:03,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-28 04:35:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 04:35:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:03,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 04:35:03,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 04:35:03,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 04:35:03,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-28 04:35:03,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:35:03,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-28 04:35:03,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-28 04:35:03,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-28 04:35:03,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-28 04:35:03,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-28 04:35:03,611 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-28 04:35:03,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 04:35:03,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 04:35:03,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 04:35:03,613 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-28 04:35:03,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-28 04:35:03,613 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {35#true} is VALID [2022-04-28 04:35:03,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-28 04:35:03,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-28 04:35:03,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-28 04:35:03,614 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-28 04:35:03,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-28 04:35:03,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-28 04:35:03,614 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-28 04:35:03,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-28 04:35:03,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-28 04:35:03,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-28 04:35:03,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:35:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:03,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656401274] [2022-04-28 04:35:03,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656401274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:03,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:03,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:35:03,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:03,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497408156] [2022-04-28 04:35:03,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497408156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:03,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:03,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:35:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596906068] [2022-04-28 04:35:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:03,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 04:35:03,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:03,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:35:03,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:03,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:35:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:03,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:35:03,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:35:03,674 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:35:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:03,796 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-28 04:35:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:35:03,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 04:35:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:35:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:35:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-28 04:35:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:35:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-28 04:35:03,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-28 04:35:03,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:03,877 INFO L225 Difference]: With dead ends: 57 [2022-04-28 04:35:03,878 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 04:35:03,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:35:03,882 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:35:03,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:35:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 04:35:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 04:35:03,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:35:03,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:35:03,924 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:35:03,924 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:35:03,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:03,926 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 04:35:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 04:35:03,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:03,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:03,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 04:35:03,927 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 04:35:03,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:03,929 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-28 04:35:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 04:35:03,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:03,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:03,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:35:03,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:35:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:35:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-28 04:35:03,933 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-28 04:35:03,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:35:03,933 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-28 04:35:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:35:03,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-28 04:35:03,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-28 04:35:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:35:03,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:03,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:03,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:35:03,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-28 04:35:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:03,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [13731018] [2022-04-28 04:35:03,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-28 04:35:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:03,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603333290] [2022-04-28 04:35:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:04,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:35:04,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530972501] [2022-04-28 04:35:04,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:35:04,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:04,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:04,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:35:04,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:35:04,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:35:04,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:35:04,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:35:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:04,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:35:04,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-28 04:35:04,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {273#true} is VALID [2022-04-28 04:35:04,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 04:35:04,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-28 04:35:04,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-28 04:35:04,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {273#true} is VALID [2022-04-28 04:35:04,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {273#true} is VALID [2022-04-28 04:35:04,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-28 04:35:04,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-28 04:35:04,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 04:35:04,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-28 04:35:04,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {273#true} is VALID [2022-04-28 04:35:04,230 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {273#true} is VALID [2022-04-28 04:35:04,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-28 04:35:04,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-28 04:35:04,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-28 04:35:04,231 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-28 04:35:04,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:04,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-28 04:35:04,233 INFO L272 TraceCheckUtils]: 19: Hoare triple {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:04,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:04,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-28 04:35:04,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-28 04:35:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:35:04,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:35:04,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:04,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603333290] [2022-04-28 04:35:04,235 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:35:04,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530972501] [2022-04-28 04:35:04,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530972501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:04,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:04,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:35:04,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [13731018] [2022-04-28 04:35:04,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [13731018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:04,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:04,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:35:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800959699] [2022-04-28 04:35:04,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:04,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 04:35:04,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:04,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:35:04,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:04,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:35:04,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:35:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:35:04,253 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:35:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:04,445 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-28 04:35:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:35:04,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 04:35:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:35:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:35:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:35:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:35:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:35:04,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 04:35:04,491 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-28 04:35:04,494 INFO L225 Difference]: With dead ends: 39 [2022-04-28 04:35:04,494 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:35:04,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:35:04,496 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:35:04,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:35:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:35:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 04:35:04,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:35:04,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:35:04,514 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:35:04,516 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:35:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:04,519 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 04:35:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 04:35:04,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:04,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:04,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 04:35:04,522 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 04:35:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:04,527 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-28 04:35:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-28 04:35:04,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:04,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:04,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:35:04,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:35:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:35:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-28 04:35:04,529 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-28 04:35:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:35:04,530 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-28 04:35:04,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 04:35:04,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-28 04:35:04,561 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-28 04:35:04,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-28 04:35:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:35:04,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:04,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:04,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 04:35:04,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:04,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-28 04:35:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:04,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118997808] [2022-04-28 04:35:04,785 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-28 04:35:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:04,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404930084] [2022-04-28 04:35:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:04,801 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:35:04,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000780797] [2022-04-28 04:35:04,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:35:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:04,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:04,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:35:04,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:35:04,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:35:04,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:35:04,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 04:35:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:04,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:35:05,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-28 04:35:05,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-28 04:35:05,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-28 04:35:05,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-28 04:35:05,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-28 04:35:05,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-28 04:35:05,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 04:35:05,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 04:35:05,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-28 04:35:05,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-28 04:35:05,161 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-28 04:35:05,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:35:05,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {611#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:35:05,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {615#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {615#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:35:05,163 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {615#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #63#return; {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,164 INFO L272 TraceCheckUtils]: 19: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-28 04:35:05,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 04:35:05,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 04:35:05,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,165 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {626#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {651#(and (= main_~x~0 0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {655#(and (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:05,168 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= 0 main_~Y~0) (= main_~Y~0 main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:05,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:05,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-28 04:35:05,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-28 04:35:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 04:35:05,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:35:05,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-28 04:35:05,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-28 04:35:05,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:05,375 INFO L272 TraceCheckUtils]: 28: Hoare triple {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:05,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {683#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:35:05,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:05,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {691#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:35:05,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:05,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:05,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 04:35:05,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 04:35:05,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-28 04:35:05,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:05,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {687#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:05,384 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {567#true} {567#true} #63#return; {567#true} is VALID [2022-04-28 04:35:05,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 04:35:05,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 04:35:05,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {567#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-28 04:35:05,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {567#true} is VALID [2022-04-28 04:35:05,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {567#true} {567#true} #61#return; {567#true} is VALID [2022-04-28 04:35:05,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-28 04:35:05,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-28 04:35:05,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {567#true} is VALID [2022-04-28 04:35:05,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-28 04:35:05,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-28 04:35:05,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-28 04:35:05,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-28 04:35:05,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-28 04:35:05,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-28 04:35:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 04:35:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:05,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404930084] [2022-04-28 04:35:05,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:35:05,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000780797] [2022-04-28 04:35:05,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000780797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:35:05,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:35:05,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2022-04-28 04:35:05,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:05,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118997808] [2022-04-28 04:35:05,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118997808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:05,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:05,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:35:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584669834] [2022-04-28 04:35:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 04:35:05,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:05,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:05,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:05,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:35:05,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:05,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:35:05,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:35:05,410 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:05,937 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-04-28 04:35:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:35:05,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 04:35:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:35:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-28 04:35:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-28 04:35:05,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-28 04:35:05,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:05,980 INFO L225 Difference]: With dead ends: 48 [2022-04-28 04:35:05,980 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 04:35:05,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:35:05,981 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:35:05,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 150 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:35:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 04:35:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-28 04:35:06,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:35:06,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:06,012 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:06,012 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:06,014 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 04:35:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 04:35:06,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:06,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:06,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 04:35:06,015 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-28 04:35:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:06,016 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-28 04:35:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-28 04:35:06,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:06,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:06,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:35:06,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:35:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 04:35:06,018 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2022-04-28 04:35:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:35:06,019 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 04:35:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:06,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 04:35:06,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 04:35:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:35:06,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:06,055 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:06,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 04:35:06,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 04:35:06,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-28 04:35:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [168092890] [2022-04-28 04:35:06,273 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:06,273 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-28 04:35:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:06,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114409270] [2022-04-28 04:35:06,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:06,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:06,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:35:06,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623413650] [2022-04-28 04:35:06,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:35:06,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:06,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:06,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:35:06,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:35:06,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:35:06,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:35:06,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 04:35:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:06,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:35:06,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-28 04:35:06,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-28 04:35:06,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-28 04:35:06,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-28 04:35:06,577 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-28 04:35:06,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 04:35:06,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 04:35:06,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,577 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-28 04:35:06,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:06,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:06,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-28 04:35:06,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 04:35:06,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 04:35:06,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,579 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:06,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:06,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {1126#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-28 04:35:06,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1130#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:35:06,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {1134#(and (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-28 04:35:06,582 INFO L272 TraceCheckUtils]: 28: Hoare triple {1138#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:06,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:06,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-28 04:35:06,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-28 04:35:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:35:06,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:35:06,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2022-04-28 04:35:06,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {1146#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1049#false} is VALID [2022-04-28 04:35:06,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1146#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:06,770 INFO L272 TraceCheckUtils]: 28: Hoare triple {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1142#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:06,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1162#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:35:06,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:06,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1170#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:35:06,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {1166#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:06,820 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1048#true} {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:35:06,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 04:35:06,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 04:35:06,821 INFO L272 TraceCheckUtils]: 19: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1048#true} is VALID [2022-04-28 04:35:06,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:35:06,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1177#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:35:06,822 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1048#true} {1048#true} #63#return; {1048#true} is VALID [2022-04-28 04:35:06,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 04:35:06,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 04:35:06,822 INFO L272 TraceCheckUtils]: 12: Hoare triple {1048#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {1048#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#true} {1048#true} #61#return; {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#true} assume !(0 == ~cond); {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#true} ~cond := #in~cond; {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret8 := main(); {1048#true} is VALID [2022-04-28 04:35:06,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #69#return; {1048#true} is VALID [2022-04-28 04:35:06,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2022-04-28 04:35:06,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1048#true} is VALID [2022-04-28 04:35:06,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2022-04-28 04:35:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:35:06,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:06,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114409270] [2022-04-28 04:35:06,824 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:35:06,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623413650] [2022-04-28 04:35:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623413650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:35:06,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:35:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-28 04:35:06,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:06,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [168092890] [2022-04-28 04:35:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [168092890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:06,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:35:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500785667] [2022-04-28 04:35:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 04:35:06,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:06,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:06,849 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-28 04:35:06,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:35:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:06,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:35:06,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:35:06,850 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:07,183 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-28 04:35:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:35:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-28 04:35:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:35:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:07,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 04:35:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 04:35:07,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-28 04:35:07,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:07,231 INFO L225 Difference]: With dead ends: 56 [2022-04-28 04:35:07,231 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 04:35:07,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:35:07,232 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:35:07,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:35:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 04:35:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2022-04-28 04:35:07,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:35:07,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:35:07,284 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:35:07,284 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:35:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:07,286 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 04:35:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-28 04:35:07,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:07,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:07,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-28 04:35:07,287 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 54 states. [2022-04-28 04:35:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:07,288 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-04-28 04:35:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-04-28 04:35:07,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:07,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:07,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:35:07,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:35:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 04:35:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-28 04:35:07,291 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 32 [2022-04-28 04:35:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:35:07,291 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-28 04:35:07,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 04:35:07,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-28 04:35:07,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-28 04:35:07,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 04:35:07,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:07,340 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:07,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 04:35:07,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:07,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-28 04:35:07,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:07,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305655668] [2022-04-28 04:35:07,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-28 04:35:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:07,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346928318] [2022-04-28 04:35:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:07,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:35:07,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812772484] [2022-04-28 04:35:07,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:35:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:07,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:35:07,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:35:07,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:35:07,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:35:07,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 04:35:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:07,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:35:19,735 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:35:25,536 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:35:30,692 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:35:37,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-28 04:35:37,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-28 04:35:37,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:37,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-28 04:35:37,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 04:35:37,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:37,475 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-28 04:35:37,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:37,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:37,484 INFO L272 TraceCheckUtils]: 19: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:37,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:37,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:37,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:37,486 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1632#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1632#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:37,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1632#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:37,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {1656#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 04:35:37,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {1660#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1664#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:35:37,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:35:37,488 INFO L272 TraceCheckUtils]: 28: Hoare triple {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:37,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:37,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {1642#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:37,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:37,490 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1668#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {1684#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} is VALID [2022-04-28 04:35:37,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1688#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:35:37,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {1688#(and (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-28 04:35:37,499 INFO L272 TraceCheckUtils]: 35: Hoare triple {1692#(and (= (+ (- 1) main_~y~0) 0) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:37,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:37,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 04:35:37,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 04:35:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 04:35:37,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:35:42,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {1577#false} assume !false; {1577#false} is VALID [2022-04-28 04:35:42,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {1700#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1577#false} is VALID [2022-04-28 04:35:42,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1700#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:42,681 INFO L272 TraceCheckUtils]: 35: Hoare triple {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1696#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:42,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1716#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:42,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1720#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:35:42,683 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1724#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:35:42,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:42,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1646#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:42,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {1576#true} ~cond := #in~cond; {1738#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:35:42,684 INFO L272 TraceCheckUtils]: 28: Hoare triple {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:42,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1728#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:35:42,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1745#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:35:42,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1749#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_16 main_~y~0)) (* (* v_main_~x~0_16 main_~Y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2))))))} is VALID [2022-04-28 04:35:42,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#true} assume !!(~x~0 <= ~X~0); {1753#(forall ((v_main_~x~0_16 Int)) (or (<= v_main_~x~0_16 main_~X~0) (not (<= v_main_~x~0_16 (+ main_~x~0 1))) (= (+ (* (* v_main_~x~0_16 main_~Y~0) 2) (* (* v_main_~x~0_16 (+ main_~y~0 1)) 2) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ (* (* v_main_~x~0_16 main_~Y~0) 2) 2 (* main_~y~0 2) (* main_~Y~0 2)))))} is VALID [2022-04-28 04:35:42,689 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1576#true} {1576#true} #65#return; {1576#true} is VALID [2022-04-28 04:35:42,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:42,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L272 TraceCheckUtils]: 19: Hoare triple {1576#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {1576#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1576#true} {1576#true} #63#return; {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L272 TraceCheckUtils]: 12: Hoare triple {1576#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:42,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {1576#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#true} {1576#true} #61#return; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#true} assume !(0 == ~cond); {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#true} ~cond := #in~cond; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#true} call #t~ret8 := main(); {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#true} {1576#true} #69#return; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#true} assume true; {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1576#true} is VALID [2022-04-28 04:35:42,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1576#true} call ULTIMATE.init(); {1576#true} is VALID [2022-04-28 04:35:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 04:35:42,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346928318] [2022-04-28 04:35:42,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:35:42,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812772484] [2022-04-28 04:35:42,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812772484] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:35:42,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:35:42,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-28 04:35:42,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:42,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305655668] [2022-04-28 04:35:42,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305655668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:42,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:42,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:35:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636091114] [2022-04-28 04:35:42,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-28 04:35:42,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:42,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:35:42,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:42,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:35:42,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:35:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:35:42,725 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:35:45,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:35:47,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:35:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:47,834 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 04:35:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:35:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-28 04:35:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:35:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:35:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-28 04:35:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:35:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-28 04:35:47,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-28 04:35:47,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:47,881 INFO L225 Difference]: With dead ends: 61 [2022-04-28 04:35:47,881 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 04:35:47,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:35:47,882 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:35:47,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 293 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 04:35:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 04:35:47,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-28 04:35:47,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:35:47,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:47,923 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:47,923 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:47,925 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 04:35:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 04:35:47,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:47,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:47,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-28 04:35:47,926 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 53 states. [2022-04-28 04:35:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:47,927 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-28 04:35:47,927 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-04-28 04:35:47,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:47,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:47,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:35:47,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:35:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 04:35:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-04-28 04:35:47,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 39 [2022-04-28 04:35:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:35:47,929 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-04-28 04:35:47,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:35:47,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 47 transitions. [2022-04-28 04:35:47,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 04:35:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 04:35:47,978 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:47,978 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:47,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:35:48,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:48,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 3 times [2022-04-28 04:35:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:48,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167406795] [2022-04-28 04:35:48,180 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash 733948825, now seen corresponding path program 4 times [2022-04-28 04:35:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:48,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262890858] [2022-04-28 04:35:48,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:48,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:35:48,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309620718] [2022-04-28 04:35:48,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:35:48,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:48,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:35:48,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 04:35:48,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:35:48,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:35:48,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 04:35:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:48,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:35:48,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 04:35:48,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 04:35:48,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 04:35:48,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-28 04:35:48,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-28 04:35:48,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-28 04:35:48,964 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:48,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:35:48,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:35:48,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:35:48,966 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2155#true} #61#return; {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:35:48,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:35:48,966 INFO L272 TraceCheckUtils]: 12: Hoare triple {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:48,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:35:48,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {2181#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:35:48,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2185#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:35:48,968 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2185#(not (= |assume_abort_if_not_#in~cond| 0))} {2192#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {2211#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {2211#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} is VALID [2022-04-28 04:35:48,969 INFO L272 TraceCheckUtils]: 19: Hoare triple {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:48,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:48,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:48,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:48,971 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} {2219#(and (= main_~x~0 0) (<= main_~X~0 10) (<= (* main_~Y~0 main_~x~0) main_~yx~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (<= main_~xy~0 (* main_~X~0 main_~y~0)))} #65#return; {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2243#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {2243#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,974 INFO L272 TraceCheckUtils]: 28: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:48,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 04:35:48,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 04:35:48,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 04:35:48,975 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2155#true} {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:35:48,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {2247#(and (<= main_~X~0 10) (= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2272#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-28 04:35:48,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {2272#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2276#(and (= (+ (- 1) main_~x~0) 1) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-28 04:35:48,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {2276#(and (= (+ (- 1) main_~x~0) 1) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2280#(and (= main_~xy~0 0) (<= main_~X~0 10) (= (* main_~Y~0 2) main_~yx~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-28 04:35:48,978 INFO L272 TraceCheckUtils]: 37: Hoare triple {2280#(and (= main_~xy~0 0) (<= main_~X~0 10) (= (* main_~Y~0 2) main_~yx~0) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:48,978 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:48,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {2288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 04:35:48,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 04:35:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 04:35:48,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:35:51,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 04:35:51,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {2288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 04:35:51,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:51,627 INFO L272 TraceCheckUtils]: 37: Hoare triple {2304#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:51,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {2308#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2304#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:35:51,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {2312#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2308#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:51,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2312#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:35:51,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:35:51,631 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2155#true} {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:35:51,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 04:35:51,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 04:35:51,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 04:35:51,631 INFO L272 TraceCheckUtils]: 28: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:51,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:35:51,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {2341#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2316#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:35:51,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2341#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-28 04:35:51,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} assume !!(~x~0 <= ~X~0); {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} is VALID [2022-04-28 04:35:51,635 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} {2352#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2345#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)))} is VALID [2022-04-28 04:35:51,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:51,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:51,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#true} ~cond := #in~cond; {2362#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:35:51,636 INFO L272 TraceCheckUtils]: 19: Hoare triple {2352#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:51,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {2369#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (mod (+ main_~X~0 main_~v~0) 2) 0)) (< (* main_~X~0 main_~y~0) (+ main_~Y~0 (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) 2) (* main_~Y~0 main_~x~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2352#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:35:51,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2369#(or (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 4)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) 0)) (not (= (mod (+ main_~X~0 main_~v~0) 2) 0)) (< (* main_~X~0 main_~y~0) (+ main_~Y~0 (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) 2) (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:35:51,637 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2155#true} {2155#true} #63#return; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L272 TraceCheckUtils]: 12: Hoare triple {2155#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {2155#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {2155#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2155#true} is VALID [2022-04-28 04:35:51,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2155#true} is VALID [2022-04-28 04:35:51,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret8 := main(); {2155#true} is VALID [2022-04-28 04:35:51,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #69#return; {2155#true} is VALID [2022-04-28 04:35:51,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 04:35:51,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 04:35:51,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 04:35:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 04:35:51,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262890858] [2022-04-28 04:35:51,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:35:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309620718] [2022-04-28 04:35:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309620718] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:35:51,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:35:51,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 26 [2022-04-28 04:35:51,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:51,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167406795] [2022-04-28 04:35:51,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167406795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:51,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:51,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:35:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380941360] [2022-04-28 04:35:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:51,641 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 04:35:51,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:51,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:35:51,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:35:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:35:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:35:51,676 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:35:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:52,620 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-28 04:35:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:35:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 04:35:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:35:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:35:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-28 04:35:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:35:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 58 transitions. [2022-04-28 04:35:52,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 58 transitions. [2022-04-28 04:35:52,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:52,673 INFO L225 Difference]: With dead ends: 61 [2022-04-28 04:35:52,673 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 04:35:52,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-04-28 04:35:52,675 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:35:52,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 146 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:35:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 04:35:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-28 04:35:52,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:35:52,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:35:52,748 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:35:52,748 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:35:52,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:52,749 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 04:35:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 04:35:52,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:52,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:52,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 57 states. [2022-04-28 04:35:52,750 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 57 states. [2022-04-28 04:35:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:35:52,751 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-04-28 04:35:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-04-28 04:35:52,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:35:52,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:35:52,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:35:52,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:35:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:35:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-04-28 04:35:52,753 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 41 [2022-04-28 04:35:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:35:52,753 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-04-28 04:35:52,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 04:35:52,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 61 transitions. [2022-04-28 04:35:52,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-28 04:35:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 04:35:52,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:35:52,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:35:52,839 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-28 04:35:53,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:53,031 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:35:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:35:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 1 times [2022-04-28 04:35:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:53,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2065315391] [2022-04-28 04:35:53,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:35:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1786011109, now seen corresponding path program 2 times [2022-04-28 04:35:53,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:35:53,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276722262] [2022-04-28 04:35:53,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:35:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:35:53,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:35:53,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675009803] [2022-04-28 04:35:53,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:35:53,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:35:53,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:35:53,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:35:53,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 04:35:53,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:35:53,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:35:53,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 04:35:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:35:53,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:35:53,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-28 04:35:53,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #69#return; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret8 := main(); {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #61#return; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:53,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-28 04:35:53,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-28 04:35:53,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:53,390 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #63#return; {2780#true} is VALID [2022-04-28 04:35:53,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,391 INFO L272 TraceCheckUtils]: 19: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:53,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-28 04:35:53,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-28 04:35:53,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:53,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2780#true} {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {2836#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2861#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {2861#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2869#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:35:53,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {2869#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:53,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} ~cond := #in~cond; {2876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:53,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {2876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:53,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:53,397 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} {2869#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,397 INFO L290 TraceCheckUtils]: 33: Hoare triple {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:35:53,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2893#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} is VALID [2022-04-28 04:35:53,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {2893#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (- 1) main_~x~0) 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2897#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1) (= main_~x~0 2))} is VALID [2022-04-28 04:35:53,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {2897#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1) (= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2901#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} is VALID [2022-04-28 04:35:53,400 INFO L272 TraceCheckUtils]: 37: Hoare triple {2901#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~Y~0 2) main_~yx~0) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:53,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:53,401 INFO L290 TraceCheckUtils]: 39: Hoare triple {2909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-28 04:35:53,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-28 04:35:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 04:35:53,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:35:59,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {2781#false} assume !false; {2781#false} is VALID [2022-04-28 04:35:59,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {2909#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2781#false} is VALID [2022-04-28 04:35:59,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2909#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:35:59,282 INFO L272 TraceCheckUtils]: 37: Hoare triple {2925#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2905#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:35:59,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2925#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:35:59,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {2933#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:59,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2933#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:35:59,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:59,287 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} {2943#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {2929#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:35:59,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:59,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {2953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:35:59,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {2780#true} ~cond := #in~cond; {2953#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:35:59,288 INFO L272 TraceCheckUtils]: 28: Hoare triple {2943#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {2780#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2943#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {2780#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {2780#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {2780#true} assume !!(~x~0 <= ~X~0); {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2780#true} {2780#true} #65#return; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {2780#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {2780#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {2780#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2780#true} {2780#true} #63#return; {2780#true} is VALID [2022-04-28 04:35:59,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L272 TraceCheckUtils]: 12: Hoare triple {2780#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {2780#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2780#true} {2780#true} #61#return; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {2780#true} assume !(0 == ~cond); {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {2780#true} ~cond := #in~cond; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {2780#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {2780#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {2780#true} call #t~ret8 := main(); {2780#true} is VALID [2022-04-28 04:35:59,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2780#true} {2780#true} #69#return; {2780#true} is VALID [2022-04-28 04:35:59,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {2780#true} assume true; {2780#true} is VALID [2022-04-28 04:35:59,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {2780#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2780#true} is VALID [2022-04-28 04:35:59,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {2780#true} call ULTIMATE.init(); {2780#true} is VALID [2022-04-28 04:35:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 04:35:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:35:59,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276722262] [2022-04-28 04:35:59,291 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:35:59,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675009803] [2022-04-28 04:35:59,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675009803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:35:59,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:35:59,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 18 [2022-04-28 04:35:59,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:35:59,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2065315391] [2022-04-28 04:35:59,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2065315391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:35:59,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:35:59,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:35:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766353380] [2022-04-28 04:35:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:35:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 04:35:59,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:35:59,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:35:59,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:35:59,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:35:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:35:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:35:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:35:59,326 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:00,160 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-28 04:36:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:36:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 04:36:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:36:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 04:36:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 04:36:00,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-28 04:36:00,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:00,226 INFO L225 Difference]: With dead ends: 72 [2022-04-28 04:36:00,226 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 04:36:00,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:36:00,227 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:36:00,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 170 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:36:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 04:36:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-04-28 04:36:00,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:36:00,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:36:00,304 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:36:00,304 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:36:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:00,306 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-28 04:36:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-28 04:36:00,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:00,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:00,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 70 states. [2022-04-28 04:36:00,306 INFO L87 Difference]: Start difference. First operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 70 states. [2022-04-28 04:36:00,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:00,308 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-28 04:36:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-28 04:36:00,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:00,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:00,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:36:00,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:36:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 43 states have internal predecessors, (46), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 04:36:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-28 04:36:00,310 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 41 [2022-04-28 04:36:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:36:00,310 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-28 04:36:00,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:00,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-28 04:36:00,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-28 04:36:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 04:36:00,403 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:36:00,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:36:00,419 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-28 04:36:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:00,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:36:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:36:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 3 times [2022-04-28 04:36:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:00,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326156275] [2022-04-28 04:36:00,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:36:00,605 INFO L85 PathProgramCache]: Analyzing trace with hash -287119529, now seen corresponding path program 4 times [2022-04-28 04:36:00,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:36:00,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122668326] [2022-04-28 04:36:00,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:36:00,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:36:00,614 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:36:00,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762446505] [2022-04-28 04:36:00,614 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:36:00,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:00,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:36:00,615 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:36:00,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 04:36:00,646 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:36:00,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:36:00,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 04:36:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:36:00,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:36:17,156 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:36:25,496 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:36:31,542 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:36:31,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #69#return; {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret8 := main(); {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {3451#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-28 04:36:31,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3451#true} {3451#true} #61#return; {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {3451#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3451#true} {3451#true} #63#return; {3451#true} is VALID [2022-04-28 04:36:31,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {3451#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 04:36:31,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 04:36:31,866 INFO L272 TraceCheckUtils]: 19: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:31,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-28 04:36:31,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-28 04:36:31,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:31,867 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3451#true} {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} #65#return; {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 04:36:31,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !!(~x~0 <= ~X~0); {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} is VALID [2022-04-28 04:36:31,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {3507#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3532#(and (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:31,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {3532#(and (= main_~x~0 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3536#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:31,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3540#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:31,869 INFO L272 TraceCheckUtils]: 28: Hoare triple {3540#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:31,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {3451#true} ~cond := #in~cond; {3547#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:31,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {3547#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:31,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:31,871 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} {3540#(and (= (+ (- 1) main_~x~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:31,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:31,873 INFO L290 TraceCheckUtils]: 34: Hoare triple {3558#(and (= (+ (- 1) main_~x~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3565#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0))) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (* (* main_~X~0 main_~y~0) 2))))} is VALID [2022-04-28 04:36:31,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {3565#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0))) (< (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (* (* main_~X~0 main_~y~0) 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3569#(and (= (+ (- 2) main_~x~0) 0) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (< (* 2 (* main_~Y~0 main_~x~0)) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)))} is VALID [2022-04-28 04:36:31,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {3569#(and (= (+ (- 2) main_~x~0) 0) (not (< (+ main_~X~0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (< (* 2 (* main_~Y~0 main_~x~0)) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3573#(and (= (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (= (* main_~X~0 (div main_~X~0 main_~X~0)) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) (+ main_~X~0 (* main_~Y~0 2))) (< (* main_~Y~0 4) (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0)))} is VALID [2022-04-28 04:36:31,877 INFO L272 TraceCheckUtils]: 37: Hoare triple {3573#(and (= (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0 main_~v~0) (* main_~Y~0 6)) (= (* main_~X~0 (div main_~X~0 main_~X~0)) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) (+ main_~X~0 (* main_~Y~0 2))) (< (* main_~Y~0 4) (+ (* (* main_~X~0 (div main_~X~0 main_~X~0)) 2) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:31,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:31,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3452#false} is VALID [2022-04-28 04:36:31,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-28 04:36:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-28 04:36:31,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:36:33,009 INFO L290 TraceCheckUtils]: 40: Hoare triple {3452#false} assume !false; {3452#false} is VALID [2022-04-28 04:36:33,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {3581#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3452#false} is VALID [2022-04-28 04:36:33,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3581#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:33,011 INFO L272 TraceCheckUtils]: 37: Hoare triple {3597#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3577#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:33,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {3601#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3597#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:36:33,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {3605#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3601#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:33,014 INFO L290 TraceCheckUtils]: 34: Hoare triple {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {3605#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:36:33,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:36:33,015 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} {3616#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {3609#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:36:33,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:33,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {3626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:33,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {3451#true} ~cond := #in~cond; {3626#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:36:33,016 INFO L272 TraceCheckUtils]: 28: Hoare triple {3616#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:33,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {3451#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3616#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {3451#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {3451#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {3451#true} assume !!(~x~0 <= ~X~0); {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3451#true} {3451#true} #65#return; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L272 TraceCheckUtils]: 19: Hoare triple {3451#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {3451#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {3451#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3451#true} {3451#true} #63#return; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:33,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L272 TraceCheckUtils]: 12: Hoare triple {3451#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {3451#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3451#true} {3451#true} #61#return; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {3451#true} assume !(0 == ~cond); {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {3451#true} ~cond := #in~cond; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {3451#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {3451#true} call #t~ret8 := main(); {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3451#true} {3451#true} #69#return; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {3451#true} assume true; {3451#true} is VALID [2022-04-28 04:36:33,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {3451#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3451#true} is VALID [2022-04-28 04:36:33,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {3451#true} call ULTIMATE.init(); {3451#true} is VALID [2022-04-28 04:36:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 04:36:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:36:33,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122668326] [2022-04-28 04:36:33,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:36:33,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762446505] [2022-04-28 04:36:33,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762446505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:36:33,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:36:33,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-04-28 04:36:33,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:36:33,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326156275] [2022-04-28 04:36:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326156275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:36:33,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:36:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:36:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144727725] [2022-04-28 04:36:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:36:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 04:36:33,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:36:33,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:33,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:33,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:36:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:36:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:36:33,053 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:34,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:34,203 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-04-28 04:36:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:36:34,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 04:36:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:36:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 04:36:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2022-04-28 04:36:34,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2022-04-28 04:36:34,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:34,278 INFO L225 Difference]: With dead ends: 86 [2022-04-28 04:36:34,278 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 04:36:34,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:36:34,279 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:36:34,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 184 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:36:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 04:36:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 04:36:34,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:36:34,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:34,406 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:34,406 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:34,408 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-28 04:36:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 04:36:34,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:34,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:34,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-28 04:36:34,409 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-04-28 04:36:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:34,410 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2022-04-28 04:36:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 04:36:34,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:34,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:34,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:36:34,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:36:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-28 04:36:34,412 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-28 04:36:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:36:34,412 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-28 04:36:34,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:34,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-28 04:36:34,533 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-28 04:36:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 04:36:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 04:36:34,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:36:34,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:36:34,550 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-28 04:36:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:34,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:36:34,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:36:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-28 04:36:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:34,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009539510] [2022-04-28 04:36:34,736 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:36:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-28 04:36:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:36:34,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705860632] [2022-04-28 04:36:34,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:36:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:36:34,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:36:34,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262814695] [2022-04-28 04:36:34,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:36:34,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:36:34,748 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:36:34,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 04:36:34,787 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:36:34,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:36:34,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 04:36:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:36:34,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:36:35,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2022-04-28 04:36:35,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {4188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4188#true} is VALID [2022-04-28 04:36:35,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4188#true} {4188#true} #69#return; {4188#true} is VALID [2022-04-28 04:36:35,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {4188#true} call #t~ret8 := main(); {4188#true} is VALID [2022-04-28 04:36:35,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {4188#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {4188#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4188#true} {4188#true} #61#return; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {4188#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L272 TraceCheckUtils]: 12: Hoare triple {4188#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,127 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4188#true} {4188#true} #63#return; {4188#true} is VALID [2022-04-28 04:36:35,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {4188#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:35,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:35,128 INFO L272 TraceCheckUtils]: 19: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,129 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4188#true} {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:35,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:35,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {4244#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4269#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:35,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {4269#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:35,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:35,132 INFO L272 TraceCheckUtils]: 28: Hoare triple {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,133 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4188#true} {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:35,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {4273#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {4295#(and (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:35,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {4295#(and (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4299#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~x~0 1))} is VALID [2022-04-28 04:36:35,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {4299#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4303#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:36:35,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {4303#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 2) main_~y~0) 0) (not (< (* main_~Y~0 2) main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4307#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} is VALID [2022-04-28 04:36:35,136 INFO L272 TraceCheckUtils]: 37: Hoare triple {4307#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~xy~0 (* main_~X~0 2)) (not (< (* main_~Y~0 2) main_~X~0)) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:35,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4315#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:35,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4189#false} is VALID [2022-04-28 04:36:35,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2022-04-28 04:36:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 04:36:35,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:36:35,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {4189#false} assume !false; {4189#false} is VALID [2022-04-28 04:36:35,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4189#false} is VALID [2022-04-28 04:36:35,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4315#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:35,501 INFO L272 TraceCheckUtils]: 37: Hoare triple {4331#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4311#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:35,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4331#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:36:35,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {4339#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:35,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4339#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:36:35,505 INFO L290 TraceCheckUtils]: 33: Hoare triple {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {4335#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:35,506 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4188#true} {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} #65#return; {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:36:35,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,506 INFO L272 TraceCheckUtils]: 28: Hoare triple {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:36:35,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {4368#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {4346#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:36:35,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4368#(or (not (<= (+ main_~x~0 1) main_~X~0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:36:35,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !!(~x~0 <= ~X~0); {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 04:36:35,512 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4188#true} {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} #65#return; {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 04:36:35,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,512 INFO L272 TraceCheckUtils]: 19: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {4188#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4372#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-28 04:36:35,513 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4188#true} {4188#true} #63#return; {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L272 TraceCheckUtils]: 12: Hoare triple {4188#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {4188#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4188#true} {4188#true} #61#return; {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {4188#true} assume !(0 == ~cond); {4188#true} is VALID [2022-04-28 04:36:35,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {4188#true} ~cond := #in~cond; {4188#true} is VALID [2022-04-28 04:36:35,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {4188#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4188#true} is VALID [2022-04-28 04:36:35,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {4188#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4188#true} is VALID [2022-04-28 04:36:35,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {4188#true} call #t~ret8 := main(); {4188#true} is VALID [2022-04-28 04:36:35,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4188#true} {4188#true} #69#return; {4188#true} is VALID [2022-04-28 04:36:35,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {4188#true} assume true; {4188#true} is VALID [2022-04-28 04:36:35,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {4188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4188#true} is VALID [2022-04-28 04:36:35,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {4188#true} call ULTIMATE.init(); {4188#true} is VALID [2022-04-28 04:36:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 04:36:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:36:35,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705860632] [2022-04-28 04:36:35,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:36:35,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262814695] [2022-04-28 04:36:35,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262814695] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:36:35,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:36:35,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2022-04-28 04:36:35,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:36:35,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009539510] [2022-04-28 04:36:35,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009539510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:36:35,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:36:35,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:36:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444843294] [2022-04-28 04:36:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:36:35,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 04:36:35,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:36:35,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:35,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:35,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:36:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:36:35,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:36:35,552 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:36,351 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-04-28 04:36:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:36:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-28 04:36:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:36:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 04:36:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2022-04-28 04:36:36,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 58 transitions. [2022-04-28 04:36:36,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:36,405 INFO L225 Difference]: With dead ends: 86 [2022-04-28 04:36:36,405 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 04:36:36,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:36:36,406 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:36:36,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 184 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:36:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 04:36:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2022-04-28 04:36:36,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:36:36,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:36,520 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:36,520 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:36,521 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-28 04:36:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-28 04:36:36,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:36,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:36,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-28 04:36:36,522 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-28 04:36:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:36,524 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-28 04:36:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-28 04:36:36,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:36,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:36,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:36:36,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:36:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-28 04:36:36,526 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 41 [2022-04-28 04:36:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:36:36,526 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-28 04:36:36,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 04:36:36,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-28 04:36:36,653 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-28 04:36:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 04:36:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 04:36:36,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:36:36,654 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:36:36,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 04:36:36,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 04:36:36,854 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:36:36,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:36:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 1 times [2022-04-28 04:36:36,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:36,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917795242] [2022-04-28 04:36:36,855 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:36:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 651179076, now seen corresponding path program 2 times [2022-04-28 04:36:36,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:36:36,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418721537] [2022-04-28 04:36:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:36:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:36:36,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:36:36,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958449211] [2022-04-28 04:36:36,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:36:36,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:36,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:36:36,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:36:36,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 04:36:36,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:36:36,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:36:36,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 04:36:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:36:36,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:36:37,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {4940#true} call ULTIMATE.init(); {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {4940#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4940#true} {4940#true} #69#return; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {4940#true} call #t~ret8 := main(); {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {4940#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {4940#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4940#true} {4940#true} #61#return; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {4940#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4940#true} is VALID [2022-04-28 04:36:37,648 INFO L272 TraceCheckUtils]: 12: Hoare triple {4940#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,649 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4940#true} {4940#true} #63#return; {4940#true} is VALID [2022-04-28 04:36:37,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {4940#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:36:37,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:36:37,650 INFO L272 TraceCheckUtils]: 19: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,650 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4940#true} {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:36:37,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:36:37,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {4996#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5021#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:36:37,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {5021#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:36:37,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:36:37,653 INFO L272 TraceCheckUtils]: 28: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,653 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4940#true} {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:36:37,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:36:37,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {5025#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5050#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:36:37,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {5050#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:36:37,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:36:37,655 INFO L272 TraceCheckUtils]: 37: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,656 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4940#true} {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:36:37,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {5054#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {4941#false} is VALID [2022-04-28 04:36:37,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {4941#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4941#false} is VALID [2022-04-28 04:36:37,657 INFO L272 TraceCheckUtils]: 44: Hoare triple {4941#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {4941#false} is VALID [2022-04-28 04:36:37,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {4941#false} ~cond := #in~cond; {4941#false} is VALID [2022-04-28 04:36:37,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {4941#false} assume 0 == ~cond; {4941#false} is VALID [2022-04-28 04:36:37,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#false} assume !false; {4941#false} is VALID [2022-04-28 04:36:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 04:36:37,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:36:37,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {4941#false} assume !false; {4941#false} is VALID [2022-04-28 04:36:37,912 INFO L290 TraceCheckUtils]: 46: Hoare triple {4941#false} assume 0 == ~cond; {4941#false} is VALID [2022-04-28 04:36:37,912 INFO L290 TraceCheckUtils]: 45: Hoare triple {4941#false} ~cond := #in~cond; {4941#false} is VALID [2022-04-28 04:36:37,912 INFO L272 TraceCheckUtils]: 44: Hoare triple {4941#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {4941#false} is VALID [2022-04-28 04:36:37,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {4941#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {4941#false} is VALID [2022-04-28 04:36:37,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {5106#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {4941#false} is VALID [2022-04-28 04:36:37,913 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4940#true} {5106#(<= main_~x~0 main_~X~0)} #65#return; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 04:36:37,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,913 INFO L290 TraceCheckUtils]: 38: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,913 INFO L272 TraceCheckUtils]: 37: Hoare triple {5106#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {5106#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 04:36:37,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {5128#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5106#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 04:36:37,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5128#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 04:36:37,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 04:36:37,926 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4940#true} {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #65#return; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 04:36:37,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,926 INFO L272 TraceCheckUtils]: 28: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,926 INFO L290 TraceCheckUtils]: 27: Hoare triple {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 04:36:37,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {5157#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5132#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 04:36:37,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {5157#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 04:36:37,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:36:37,929 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4940#true} {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #65#return; {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:36:37,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,929 INFO L272 TraceCheckUtils]: 19: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:36:37,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {4940#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5161#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:36:37,930 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4940#true} {4940#true} #63#return; {4940#true} is VALID [2022-04-28 04:36:37,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,930 INFO L272 TraceCheckUtils]: 12: Hoare triple {4940#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {4940#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4940#true} {4940#true} #61#return; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {4940#true} assume !(0 == ~cond); {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {4940#true} ~cond := #in~cond; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {4940#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {4940#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {4940#true} call #t~ret8 := main(); {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4940#true} {4940#true} #69#return; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {4940#true} assume true; {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {4940#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4940#true} is VALID [2022-04-28 04:36:37,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {4940#true} call ULTIMATE.init(); {4940#true} is VALID [2022-04-28 04:36:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 04:36:37,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:36:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418721537] [2022-04-28 04:36:37,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:36:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958449211] [2022-04-28 04:36:37,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958449211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:36:37,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:36:37,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 04:36:37,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:36:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917795242] [2022-04-28 04:36:37,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917795242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:36:37,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:36:37,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:36:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361985941] [2022-04-28 04:36:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:36:37,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-28 04:36:37,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:36:37,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:37,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:37,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:36:37,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:36:37,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:36:37,962 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:38,332 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-04-28 04:36:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:36:38,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-28 04:36:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:36:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 04:36:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 04:36:38,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-28 04:36:38,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:38,373 INFO L225 Difference]: With dead ends: 87 [2022-04-28 04:36:38,373 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 04:36:38,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:36:38,374 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:36:38,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:36:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 04:36:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-28 04:36:38,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:36:38,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:36:38,504 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:36:38,505 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:36:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:38,507 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-28 04:36:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-28 04:36:38,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:38,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:38,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-28 04:36:38,507 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 79 states. [2022-04-28 04:36:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:38,509 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-04-28 04:36:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-04-28 04:36:38,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:38,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:38,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:36:38,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:36:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:36:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-04-28 04:36:38,510 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 48 [2022-04-28 04:36:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:36:38,511 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-04-28 04:36:38,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:38,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 84 transitions. [2022-04-28 04:36:38,642 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-28 04:36:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-28 04:36:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 04:36:38,643 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:36:38,643 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:36:38,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 04:36:38,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 04:36:38,845 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:36:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:36:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-28 04:36:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1595870062] [2022-04-28 04:36:38,846 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:36:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-28 04:36:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:36:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260587433] [2022-04-28 04:36:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:36:38,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:36:38,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:36:38,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873318903] [2022-04-28 04:36:38,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:36:38,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:38,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:36:38,857 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:36:38,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 04:36:38,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:36:38,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:36:38,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 04:36:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:36:38,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:36:39,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {5723#true} call ULTIMATE.init(); {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5723#true} {5723#true} #69#return; {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {5723#true} call #t~ret8 := main(); {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {5723#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {5723#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:39,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5723#true} {5723#true} #61#return; {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {5723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L272 TraceCheckUtils]: 12: Hoare triple {5723#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5723#true} {5723#true} #63#return; {5723#true} is VALID [2022-04-28 04:36:39,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {5723#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:39,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:39,617 INFO L272 TraceCheckUtils]: 19: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:39,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:39,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:39,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:39,618 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5723#true} {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:39,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:39,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {5779#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5804#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:39,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {5804#(and (= main_~x~0 0) (= main_~y~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:39,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:39,620 INFO L272 TraceCheckUtils]: 28: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:39,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {5723#true} ~cond := #in~cond; {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:39,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:39,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:39,621 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:39,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {5808#(and (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {5832#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:36:39,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {5832#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5836#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= main_~x~0 1))} is VALID [2022-04-28 04:36:39,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {5836#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:36:39,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:36:39,623 INFO L272 TraceCheckUtils]: 37: Hoare triple {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:39,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {5723#true} ~cond := #in~cond; {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:39,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {5818#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:39,624 INFO L290 TraceCheckUtils]: 40: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:39,625 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5844#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:36:39,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {5840#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {5863#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:36:39,626 INFO L290 TraceCheckUtils]: 43: Hoare triple {5863#(and (= (+ (- 1) main_~x~0) 1) (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5867#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-28 04:36:39,627 INFO L272 TraceCheckUtils]: 44: Hoare triple {5867#(and (= main_~y~0 2) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:39,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:39,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {5875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5724#false} is VALID [2022-04-28 04:36:39,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {5724#false} assume !false; {5724#false} is VALID [2022-04-28 04:36:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 04:36:39,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:36:40,298 INFO L290 TraceCheckUtils]: 47: Hoare triple {5724#false} assume !false; {5724#false} is VALID [2022-04-28 04:36:40,298 INFO L290 TraceCheckUtils]: 46: Hoare triple {5875#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5724#false} is VALID [2022-04-28 04:36:40,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5875#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:40,299 INFO L272 TraceCheckUtils]: 44: Hoare triple {5891#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {5871#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:40,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {5895#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {5891#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:40,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {5895#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:36:40,301 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {5899#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:36:40,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:40,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {5913#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5822#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:40,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {5723#true} ~cond := #in~cond; {5913#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:36:40,302 INFO L272 TraceCheckUtils]: 37: Hoare triple {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:40,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {5920#(or (<= main_~x~0 main_~X~0) (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5903#(or (<= main_~x~0 main_~X~0) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:36:40,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {5924#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5920#(or (<= main_~x~0 main_~X~0) (not (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:36:40,331 INFO L290 TraceCheckUtils]: 34: Hoare triple {5928#(or (<= (+ main_~x~0 1) main_~X~0) (not (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5924#(or (not (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-28 04:36:40,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {5723#true} assume !!(~x~0 <= ~X~0); {5928#(or (<= (+ main_~x~0 1) main_~X~0) (not (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:36:40,333 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5723#true} {5723#true} #65#return; {5723#true} is VALID [2022-04-28 04:36:40,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:40,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L272 TraceCheckUtils]: 28: Hoare triple {5723#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {5723#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {5723#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {5723#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {5723#true} assume !!(~x~0 <= ~X~0); {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5723#true} {5723#true} #65#return; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L272 TraceCheckUtils]: 19: Hoare triple {5723#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {5723#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {5723#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {5723#true} is VALID [2022-04-28 04:36:40,334 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5723#true} {5723#true} #63#return; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L272 TraceCheckUtils]: 12: Hoare triple {5723#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {5723#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5723#true} {5723#true} #61#return; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {5723#true} assume !(0 == ~cond); {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {5723#true} ~cond := #in~cond; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L272 TraceCheckUtils]: 6: Hoare triple {5723#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {5723#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {5723#true} call #t~ret8 := main(); {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5723#true} {5723#true} #69#return; {5723#true} is VALID [2022-04-28 04:36:40,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {5723#true} assume true; {5723#true} is VALID [2022-04-28 04:36:40,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5723#true} is VALID [2022-04-28 04:36:40,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {5723#true} call ULTIMATE.init(); {5723#true} is VALID [2022-04-28 04:36:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 04:36:40,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:36:40,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260587433] [2022-04-28 04:36:40,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:36:40,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873318903] [2022-04-28 04:36:40,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873318903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:36:40,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:36:40,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-28 04:36:40,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:36:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1595870062] [2022-04-28 04:36:40,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1595870062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:36:40,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:36:40,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:36:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619561173] [2022-04-28 04:36:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:36:40,337 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-28 04:36:40,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:36:40,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:40,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:40,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:36:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:36:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:36:40,390 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:41,607 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-28 04:36:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:36:41,607 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-28 04:36:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:36:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 04:36:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 04:36:41,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-28 04:36:41,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:41,661 INFO L225 Difference]: With dead ends: 90 [2022-04-28 04:36:41,661 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 04:36:41,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:36:41,662 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:36:41,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:36:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 04:36:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 73. [2022-04-28 04:36:41,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:36:41,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:41,788 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:41,788 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:41,790 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-28 04:36:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-28 04:36:41,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:41,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:41,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-28 04:36:41,790 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 82 states. [2022-04-28 04:36:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:41,791 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-04-28 04:36:41,791 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-28 04:36:41,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:41,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:41,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:36:41,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:36:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-04-28 04:36:41,793 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 48 [2022-04-28 04:36:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:36:41,793 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-04-28 04:36:41,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:41,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 80 transitions. [2022-04-28 04:36:41,913 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-28 04:36:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-04-28 04:36:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:36:41,914 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:36:41,914 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:36:41,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 04:36:42,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 04:36:42,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:36:42,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:36:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 5 times [2022-04-28 04:36:42,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:42,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1946639008] [2022-04-28 04:36:42,115 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:36:42,115 INFO L85 PathProgramCache]: Analyzing trace with hash -463038031, now seen corresponding path program 6 times [2022-04-28 04:36:42,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:36:42,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986280427] [2022-04-28 04:36:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:36:42,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:36:42,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:36:42,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963412573] [2022-04-28 04:36:42,126 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:36:42,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:42,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:36:42,127 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:36:42,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 04:36:42,178 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:36:42,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:36:42,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 04:36:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:36:42,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:36:51,835 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:36:55,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {6531#true} call ULTIMATE.init(); {6531#true} is VALID [2022-04-28 04:36:55,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {6531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6531#true} is VALID [2022-04-28 04:36:55,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:55,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6531#true} {6531#true} #69#return; {6531#true} is VALID [2022-04-28 04:36:55,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {6531#true} call #t~ret8 := main(); {6531#true} is VALID [2022-04-28 04:36:55,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {6531#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L272 TraceCheckUtils]: 6: Hoare triple {6531#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6531#true} {6531#true} #61#return; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {6531#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L272 TraceCheckUtils]: 12: Hoare triple {6531#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:55,076 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6531#true} {6531#true} #63#return; {6531#true} is VALID [2022-04-28 04:36:55,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {6531#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,077 INFO L272 TraceCheckUtils]: 19: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:55,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:55,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:55,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:55,078 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6531#true} {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {6587#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:36:55,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:36:55,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:36:55,079 INFO L272 TraceCheckUtils]: 28: Hoare triple {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:55,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {6531#true} ~cond := #in~cond; {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:55,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:55,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:55,081 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6619#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:36:55,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:36:55,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {6612#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {6643#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:36:55,083 INFO L272 TraceCheckUtils]: 37: Hoare triple {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:55,083 INFO L290 TraceCheckUtils]: 38: Hoare triple {6531#true} ~cond := #in~cond; {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:55,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {6626#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:55,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:55,084 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6650#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-28 04:36:55,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {6666#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6673#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:36:55,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {6673#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6677#(and (= main_~y~0 0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:36:55,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {6677#(and (= main_~y~0 0) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6681#(and (= main_~xy~0 0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:36:55,091 INFO L272 TraceCheckUtils]: 46: Hoare triple {6681#(and (= main_~xy~0 0) (= (* main_~Y~0 (div (* main_~Y~0 3) main_~Y~0)) main_~yx~0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:55,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:55,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {6689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6532#false} is VALID [2022-04-28 04:36:55,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {6532#false} assume !false; {6532#false} is VALID [2022-04-28 04:36:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 04:36:55,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:36:57,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {6532#false} assume !false; {6532#false} is VALID [2022-04-28 04:36:57,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {6689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6532#false} is VALID [2022-04-28 04:36:57,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:36:57,741 INFO L272 TraceCheckUtils]: 46: Hoare triple {6705#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:36:57,742 INFO L290 TraceCheckUtils]: 45: Hoare triple {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6705#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:36:57,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {6713#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:57,744 INFO L290 TraceCheckUtils]: 43: Hoare triple {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6713#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:36:57,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:57,745 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} {6723#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {6709#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:36:57,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:57,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {6733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:36:57,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {6531#true} ~cond := #in~cond; {6733#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:36:57,746 INFO L272 TraceCheckUtils]: 37: Hoare triple {6723#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:57,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6723#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:36:57,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {6531#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6531#true} is VALID [2022-04-28 04:36:57,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {6531#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6531#true} is VALID [2022-04-28 04:36:57,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {6531#true} assume !!(~x~0 <= ~X~0); {6531#true} is VALID [2022-04-28 04:36:57,747 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6531#true} {6531#true} #65#return; {6531#true} is VALID [2022-04-28 04:36:57,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L272 TraceCheckUtils]: 28: Hoare triple {6531#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {6531#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {6531#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {6531#true} assume !!(~x~0 <= ~X~0); {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6531#true} {6531#true} #65#return; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L272 TraceCheckUtils]: 19: Hoare triple {6531#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {6531#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {6531#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {6531#true} is VALID [2022-04-28 04:36:57,748 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6531#true} {6531#true} #63#return; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L272 TraceCheckUtils]: 12: Hoare triple {6531#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {6531#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6531#true} {6531#true} #61#return; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {6531#true} assume !(0 == ~cond); {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {6531#true} ~cond := #in~cond; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L272 TraceCheckUtils]: 6: Hoare triple {6531#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {6531#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {6531#true} call #t~ret8 := main(); {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6531#true} {6531#true} #69#return; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {6531#true} assume true; {6531#true} is VALID [2022-04-28 04:36:57,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {6531#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6531#true} is VALID [2022-04-28 04:36:57,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {6531#true} call ULTIMATE.init(); {6531#true} is VALID [2022-04-28 04:36:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 04:36:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:36:57,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986280427] [2022-04-28 04:36:57,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:36:57,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963412573] [2022-04-28 04:36:57,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963412573] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:36:57,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:36:57,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-28 04:36:57,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:36:57,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1946639008] [2022-04-28 04:36:57,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1946639008] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:36:57,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:36:57,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:36:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329090593] [2022-04-28 04:36:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:36:57,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:36:57,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:36:57,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:57,793 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-28 04:36:57,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:36:57,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:36:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:36:57,794 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:59,058 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-04-28 04:36:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:36:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:36:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:36:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-28 04:36:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-28 04:36:59,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-28 04:36:59,126 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-28 04:36:59,127 INFO L225 Difference]: With dead ends: 88 [2022-04-28 04:36:59,127 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 04:36:59,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:36:59,128 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:36:59,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 198 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:36:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 04:36:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2022-04-28 04:36:59,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:36:59,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:59,264 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:59,264 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:59,265 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-28 04:36:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-28 04:36:59,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:59,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:59,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-28 04:36:59,266 INFO L87 Difference]: Start difference. First operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 84 states. [2022-04-28 04:36:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:36:59,267 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-28 04:36:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-04-28 04:36:59,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:36:59,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:36:59,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:36:59,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:36:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:36:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-04-28 04:36:59,269 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 50 [2022-04-28 04:36:59,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:36:59,269 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-04-28 04:36:59,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:36:59,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 83 transitions. [2022-04-28 04:36:59,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:36:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-04-28 04:36:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:36:59,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:36:59,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:36:59,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 04:36:59,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 04:36:59,635 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:36:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:36:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 5 times [2022-04-28 04:36:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:36:59,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [202952870] [2022-04-28 04:36:59,636 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:36:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1311969331, now seen corresponding path program 6 times [2022-04-28 04:36:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:36:59,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599273514] [2022-04-28 04:36:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:36:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:36:59,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:36:59,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318810542] [2022-04-28 04:36:59,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:36:59,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:36:59,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:36:59,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:36:59,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 04:36:59,694 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:36:59,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:36:59,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 04:36:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:36:59,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:37:00,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {7352#true} call ULTIMATE.init(); {7352#true} is VALID [2022-04-28 04:37:00,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {7352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7352#true} is VALID [2022-04-28 04:37:00,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:00,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7352#true} {7352#true} #69#return; {7352#true} is VALID [2022-04-28 04:37:00,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#true} call #t~ret8 := main(); {7352#true} is VALID [2022-04-28 04:37:00,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7352#true} is VALID [2022-04-28 04:37:00,437 INFO L272 TraceCheckUtils]: 6: Hoare triple {7352#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:00,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {7352#true} ~cond := #in~cond; {7378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:37:00,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {7378#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {7382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:37:00,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {7382#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {7382#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:37:00,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7382#(not (= |assume_abort_if_not_#in~cond| 0))} {7352#true} #61#return; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:37:00,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:37:00,438 INFO L272 TraceCheckUtils]: 12: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:00,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:00,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:00,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:00,439 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#true} {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:37:00,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {7389#(and (<= main_~X~0 10) (<= 0 main_~X~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,440 INFO L272 TraceCheckUtils]: 19: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:00,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:00,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:00,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:00,441 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7352#true} {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} #65#return; {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {7411#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~X~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7436#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {7436#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~X~0) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,443 INFO L272 TraceCheckUtils]: 28: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:00,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:00,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:00,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:00,443 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7352#true} {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} #65#return; {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:37:00,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {7440#(and (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7465#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:37:00,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {7465#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-28 04:37:00,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} is VALID [2022-04-28 04:37:00,446 INFO L272 TraceCheckUtils]: 37: Hoare triple {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:00,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {7352#true} ~cond := #in~cond; {7480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:00,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {7480#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:00,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:00,447 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} {7473#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~x~0 2))} #65#return; {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} is VALID [2022-04-28 04:37:00,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {7469#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~v~0 (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {7494#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= main_~x~0 2) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-28 04:37:00,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {7494#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= main_~x~0 2) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7498#(and (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2))} is VALID [2022-04-28 04:37:00,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {7498#(and (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7502#(and (= main_~x~0 3) (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-28 04:37:00,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {7502#(and (= main_~x~0 3) (<= main_~X~0 10) (= main_~y~0 1) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7506#(and (<= main_~X~0 10) (= (* main_~Y~0 3) main_~yx~0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-28 04:37:00,451 INFO L272 TraceCheckUtils]: 46: Hoare triple {7506#(and (<= main_~X~0 10) (= (* main_~Y~0 3) main_~yx~0) (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:37:00,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:00,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {7514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7353#false} is VALID [2022-04-28 04:37:00,451 INFO L290 TraceCheckUtils]: 49: Hoare triple {7353#false} assume !false; {7353#false} is VALID [2022-04-28 04:37:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 04:37:00,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:37:05,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {7353#false} assume !false; {7353#false} is VALID [2022-04-28 04:37:05,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {7514#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7353#false} is VALID [2022-04-28 04:37:05,395 INFO L290 TraceCheckUtils]: 47: Hoare triple {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7514#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:05,396 INFO L272 TraceCheckUtils]: 46: Hoare triple {7530#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7510#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:37:05,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {7534#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7530#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:37:05,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {7538#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7534#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:37:05,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {7542#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7538#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:37:05,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {7546#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {7542#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:37:05,401 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} {7550#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {7546#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:37:05,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:05,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {7560#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {7484#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:05,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {7352#true} ~cond := #in~cond; {7560#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:37:05,402 INFO L272 TraceCheckUtils]: 37: Hoare triple {7550#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:05,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7550#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:37:05,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {7352#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7352#true} is VALID [2022-04-28 04:37:05,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {7352#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7352#true} is VALID [2022-04-28 04:37:05,403 INFO L290 TraceCheckUtils]: 33: Hoare triple {7352#true} assume !!(~x~0 <= ~X~0); {7352#true} is VALID [2022-04-28 04:37:05,403 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7352#true} {7352#true} #65#return; {7352#true} is VALID [2022-04-28 04:37:05,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L272 TraceCheckUtils]: 28: Hoare triple {7352#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {7352#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {7352#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {7352#true} assume !!(~x~0 <= ~X~0); {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7352#true} {7352#true} #65#return; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L272 TraceCheckUtils]: 19: Hoare triple {7352#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {7352#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {7352#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {7352#true} is VALID [2022-04-28 04:37:05,404 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7352#true} {7352#true} #63#return; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L272 TraceCheckUtils]: 12: Hoare triple {7352#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {7352#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7352#true} {7352#true} #61#return; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {7352#true} assume !(0 == ~cond); {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {7352#true} ~cond := #in~cond; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {7352#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {7352#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {7352#true} call #t~ret8 := main(); {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7352#true} {7352#true} #69#return; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {7352#true} assume true; {7352#true} is VALID [2022-04-28 04:37:05,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {7352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7352#true} is VALID [2022-04-28 04:37:05,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {7352#true} call ULTIMATE.init(); {7352#true} is VALID [2022-04-28 04:37:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 04:37:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:37:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599273514] [2022-04-28 04:37:05,406 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:37:05,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318810542] [2022-04-28 04:37:05,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318810542] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:37:05,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:37:05,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 26 [2022-04-28 04:37:05,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:37:05,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [202952870] [2022-04-28 04:37:05,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [202952870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:37:05,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:37:05,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:37:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887615609] [2022-04-28 04:37:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:37:05,407 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 04:37:05,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:37:05,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:37:05,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:37:05,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:37:05,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:37:05,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:37:05,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:37:05,448 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:37:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:37:07,032 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-04-28 04:37:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:37:07,033 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 04:37:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:37:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:37:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2022-04-28 04:37:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:37:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 77 transitions. [2022-04-28 04:37:07,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 77 transitions. [2022-04-28 04:37:07,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:37:07,110 INFO L225 Difference]: With dead ends: 101 [2022-04-28 04:37:07,110 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 04:37:07,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:37:07,110 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:37:07,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 209 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:37:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 04:37:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-28 04:37:07,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:37:07,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:37:07,267 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:37:07,267 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:37:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:37:07,269 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-28 04:37:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-28 04:37:07,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:37:07,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:37:07,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 88 states. [2022-04-28 04:37:07,269 INFO L87 Difference]: Start difference. First operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 88 states. [2022-04-28 04:37:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:37:07,271 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-28 04:37:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-28 04:37:07,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:37:07,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:37:07,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:37:07,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:37:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.109375) internal successors, (71), 65 states have internal predecessors, (71), 13 states have call successors, (13), 11 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 04:37:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-04-28 04:37:07,272 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 50 [2022-04-28 04:37:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:37:07,272 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-04-28 04:37:07,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 18 states have internal predecessors, (33), 6 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 04:37:07,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 95 transitions. [2022-04-28 04:37:07,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:37:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-04-28 04:37:07,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:37:07,438 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:37:07,438 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:37:07,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 04:37:07,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 04:37:07,639 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:37:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:37:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 7 times [2022-04-28 04:37:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:37:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [131114482] [2022-04-28 04:37:07,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:37:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1484106385, now seen corresponding path program 8 times [2022-04-28 04:37:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:37:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214573189] [2022-04-28 04:37:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:37:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:37:07,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:37:07,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198749011] [2022-04-28 04:37:07,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:37:07,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:37:07,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:37:07,650 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:37:07,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 04:37:07,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:37:07,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:37:07,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 04:37:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:37:07,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:37:24,842 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:37:32,292 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:37:37,166 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:37:45,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {8241#true} call ULTIMATE.init(); {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {8241#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8241#true} {8241#true} #69#return; {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {8241#true} call #t~ret8 := main(); {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {8241#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L272 TraceCheckUtils]: 6: Hoare triple {8241#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:45,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8241#true} {8241#true} #61#return; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {8241#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8241#true} {8241#true} #63#return; {8241#true} is VALID [2022-04-28 04:37:45,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {8241#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:37:45,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:37:45,265 INFO L272 TraceCheckUtils]: 19: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:45,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:45,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:45,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:45,266 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8241#true} {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:37:45,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:37:45,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {8297#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:37:45,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:37:45,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {8322#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:37:45,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:45,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {8241#true} ~cond := #in~cond; {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:45,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:45,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:45,269 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8329#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #65#return; {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-28 04:37:45,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !!(~x~0 <= ~X~0); {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} is VALID [2022-04-28 04:37:45,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {8347#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 4))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-28 04:37:45,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-28 04:37:45,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {8354#(= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:37:45,271 INFO L272 TraceCheckUtils]: 37: Hoare triple {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:45,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {8241#true} ~cond := #in~cond; {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:45,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {8336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:45,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:45,272 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8361#(and (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:37:45,273 INFO L290 TraceCheckUtils]: 42: Hoare triple {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:37:45,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {8377#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~Y~0 4) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8384#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-28 04:37:45,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {8384#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8388#(and (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))))} is VALID [2022-04-28 04:37:47,277 WARN L290 TraceCheckUtils]: 45: Hoare triple {8388#(and (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8392#(and (or (and (or (and (= (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) 0) (= main_~yx~0 0)) (and (= (mod (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (and (= main_~yx~0 0) (= main_~Y~0 0))))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is UNKNOWN [2022-04-28 04:37:47,280 INFO L272 TraceCheckUtils]: 46: Hoare triple {8392#(and (or (and (or (and (= (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) 0) (= main_~yx~0 0)) (and (= (mod (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0) (* (- 1) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) main_~X~0)) (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (and (= main_~yx~0 0) (= main_~Y~0 0))))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:37:47,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:47,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {8400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8242#false} is VALID [2022-04-28 04:37:47,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {8242#false} assume !false; {8242#false} is VALID [2022-04-28 04:37:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 04:37:47,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:37:50,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {8242#false} assume !false; {8242#false} is VALID [2022-04-28 04:37:50,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {8400#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8242#false} is VALID [2022-04-28 04:37:50,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8400#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:37:50,254 INFO L272 TraceCheckUtils]: 46: Hoare triple {8416#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8396#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:37:50,255 INFO L290 TraceCheckUtils]: 45: Hoare triple {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8416#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:37:50,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {8424#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:37:50,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8424#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:37:50,275 INFO L290 TraceCheckUtils]: 42: Hoare triple {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:37:50,276 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} {8434#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {8420#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:37:50,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:50,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {8444#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {8340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:37:50,276 INFO L290 TraceCheckUtils]: 38: Hoare triple {8241#true} ~cond := #in~cond; {8444#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:37:50,277 INFO L272 TraceCheckUtils]: 37: Hoare triple {8434#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:50,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8434#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:37:50,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {8241#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8241#true} is VALID [2022-04-28 04:37:50,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {8241#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8241#true} is VALID [2022-04-28 04:37:50,277 INFO L290 TraceCheckUtils]: 33: Hoare triple {8241#true} assume !!(~x~0 <= ~X~0); {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8241#true} {8241#true} #65#return; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L272 TraceCheckUtils]: 28: Hoare triple {8241#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {8241#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {8241#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {8241#true} assume !!(~x~0 <= ~X~0); {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8241#true} {8241#true} #65#return; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L272 TraceCheckUtils]: 19: Hoare triple {8241#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:50,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {8241#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {8241#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8241#true} {8241#true} #63#return; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L272 TraceCheckUtils]: 12: Hoare triple {8241#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {8241#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8241#true} {8241#true} #61#return; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {8241#true} assume !(0 == ~cond); {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {8241#true} ~cond := #in~cond; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {8241#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {8241#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {8241#true} call #t~ret8 := main(); {8241#true} is VALID [2022-04-28 04:37:50,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8241#true} {8241#true} #69#return; {8241#true} is VALID [2022-04-28 04:37:50,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {8241#true} assume true; {8241#true} is VALID [2022-04-28 04:37:50,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {8241#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {8241#true} is VALID [2022-04-28 04:37:50,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {8241#true} call ULTIMATE.init(); {8241#true} is VALID [2022-04-28 04:37:50,280 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 04:37:50,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:37:50,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214573189] [2022-04-28 04:37:50,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:37:50,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198749011] [2022-04-28 04:37:50,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198749011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:37:50,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:37:50,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 21 [2022-04-28 04:37:50,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:37:50,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [131114482] [2022-04-28 04:37:50,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [131114482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:37:50,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:37:50,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:37:50,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153671884] [2022-04-28 04:37:50,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:37:50,281 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:37:50,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:37:50,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:37:52,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:37:52,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:37:52,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:37:52,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:37:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:37:52,318 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:37:55,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:00,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:02,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:05,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:38:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:12,824 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2022-04-28 04:38:12,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:38:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:38:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:38:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-28 04:38:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-28 04:38:12,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-28 04:38:14,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 64 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:14,895 INFO L225 Difference]: With dead ends: 106 [2022-04-28 04:38:14,895 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 04:38:14,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2022-04-28 04:38:14,896 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:38:14,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 213 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 426 Invalid, 4 Unknown, 0 Unchecked, 11.5s Time] [2022-04-28 04:38:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 04:38:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-04-28 04:38:15,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:38:15,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:38:15,067 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:38:15,067 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:38:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:15,069 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-04-28 04:38:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-04-28 04:38:15,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:38:15,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:38:15,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 104 states. [2022-04-28 04:38:15,069 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 104 states. [2022-04-28 04:38:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:15,071 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2022-04-28 04:38:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-04-28 04:38:15,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:38:15,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:38:15,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:38:15,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:38:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 75 states have internal predecessors, (81), 15 states have call successors, (15), 12 states have call predecessors, (15), 11 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 04:38:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-04-28 04:38:15,073 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 50 [2022-04-28 04:38:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:38:15,073 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-04-28 04:38:15,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 15 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:15,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 109 transitions. [2022-04-28 04:38:17,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 108 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-04-28 04:38:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:38:17,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:38:17,303 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:38:17,319 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-28 04:38:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 04:38:17,504 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:38:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:38:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 9 times [2022-04-28 04:38:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:38:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1827054177] [2022-04-28 04:38:17,504 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:38:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash 290900977, now seen corresponding path program 10 times [2022-04-28 04:38:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:38:17,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598732658] [2022-04-28 04:38:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:38:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:38:17,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:38:17,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635875131] [2022-04-28 04:38:17,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:38:17,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:38:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:38:17,515 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:38:17,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 04:38:17,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:38:17,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:38:17,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:38:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:38:17,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:38:17,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} call ULTIMATE.init(); {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9191#true} {9191#true} #69#return; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {9191#true} call #t~ret8 := main(); {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {9191#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L272 TraceCheckUtils]: 6: Hoare triple {9191#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9191#true} #61#return; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9191#true} is VALID [2022-04-28 04:38:17,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {9191#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:17,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:17,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:17,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:17,855 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9191#true} {9191#true} #63#return; {9191#true} is VALID [2022-04-28 04:38:17,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:17,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:17,856 INFO L272 TraceCheckUtils]: 19: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:17,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:17,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:17,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:17,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} #65#return; {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:17,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:17,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {9247#(<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-28 04:38:17,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-28 04:38:17,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-28 04:38:17,858 INFO L272 TraceCheckUtils]: 28: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:17,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:17,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:17,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:17,862 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9191#true} {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} #65#return; {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-28 04:38:17,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} is VALID [2022-04-28 04:38:17,863 INFO L290 TraceCheckUtils]: 34: Hoare triple {9272#(and (< (* main_~Y~0 2) main_~X~0) (< main_~v~0 (* main_~Y~0 2)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-28 04:38:17,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-28 04:38:17,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-28 04:38:17,864 INFO L272 TraceCheckUtils]: 37: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:17,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:17,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:17,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:17,865 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9191#true} {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} #65#return; {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-28 04:38:17,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !!(~x~0 <= ~X~0); {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} is VALID [2022-04-28 04:38:17,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {9300#(< 0 (div (+ (- 1) (* (- 1) main_~v~0)) 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {9192#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {9192#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L272 TraceCheckUtils]: 46: Hoare triple {9192#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L290 TraceCheckUtils]: 47: Hoare triple {9192#false} ~cond := #in~cond; {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {9192#false} assume 0 == ~cond; {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {9192#false} assume !false; {9192#false} is VALID [2022-04-28 04:38:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 04:38:17,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:38:18,052 INFO L290 TraceCheckUtils]: 49: Hoare triple {9192#false} assume !false; {9192#false} is VALID [2022-04-28 04:38:18,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {9192#false} assume 0 == ~cond; {9192#false} is VALID [2022-04-28 04:38:18,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {9192#false} ~cond := #in~cond; {9192#false} is VALID [2022-04-28 04:38:18,052 INFO L272 TraceCheckUtils]: 46: Hoare triple {9192#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9192#false} is VALID [2022-04-28 04:38:18,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {9192#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9192#false} is VALID [2022-04-28 04:38:18,053 INFO L290 TraceCheckUtils]: 44: Hoare triple {9192#false} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9192#false} is VALID [2022-04-28 04:38:18,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {9364#(< main_~v~0 0)} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9192#false} is VALID [2022-04-28 04:38:18,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {9364#(< main_~v~0 0)} assume !!(~x~0 <= ~X~0); {9364#(< main_~v~0 0)} is VALID [2022-04-28 04:38:18,054 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9191#true} {9364#(< main_~v~0 0)} #65#return; {9364#(< main_~v~0 0)} is VALID [2022-04-28 04:38:18,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:18,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:18,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:18,054 INFO L272 TraceCheckUtils]: 37: Hoare triple {9364#(< main_~v~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:18,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {9364#(< main_~v~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9364#(< main_~v~0 0)} is VALID [2022-04-28 04:38:18,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {9364#(< main_~v~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9364#(< main_~v~0 0)} is VALID [2022-04-28 04:38:18,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9364#(< main_~v~0 0)} is VALID [2022-04-28 04:38:18,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !!(~x~0 <= ~X~0); {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-28 04:38:18,056 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9191#true} {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #65#return; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-28 04:38:18,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:18,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:18,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:18,056 INFO L272 TraceCheckUtils]: 28: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:18,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-28 04:38:18,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-28 04:38:18,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {9392#(< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))} is VALID [2022-04-28 04:38:18,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:38:18,058 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9191#true} {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} #65#return; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:38:18,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:18,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:18,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:18,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:18,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {9191#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {9420#(or (< (+ main_~v~0 (* main_~Y~0 4)) (* main_~X~0 2)) (not (< main_~v~0 0)))} is VALID [2022-04-28 04:38:18,060 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9191#true} {9191#true} #63#return; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L272 TraceCheckUtils]: 12: Hoare triple {9191#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9191#true} {9191#true} #61#return; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {9191#true} assume !(0 == ~cond); {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {9191#true} ~cond := #in~cond; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {9191#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {9191#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {9191#true} is VALID [2022-04-28 04:38:18,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {9191#true} call #t~ret8 := main(); {9191#true} is VALID [2022-04-28 04:38:18,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9191#true} {9191#true} #69#return; {9191#true} is VALID [2022-04-28 04:38:18,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {9191#true} assume true; {9191#true} is VALID [2022-04-28 04:38:18,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {9191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9191#true} is VALID [2022-04-28 04:38:18,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {9191#true} call ULTIMATE.init(); {9191#true} is VALID [2022-04-28 04:38:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 04:38:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:38:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598732658] [2022-04-28 04:38:18,061 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:38:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635875131] [2022-04-28 04:38:18,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635875131] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:38:18,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:38:18,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 04:38:18,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:38:18,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1827054177] [2022-04-28 04:38:18,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1827054177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:38:18,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:38:18,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:38:18,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379226062] [2022-04-28 04:38:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:38:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:38:18,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:38:18,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:18,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:18,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:38:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:38:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:38:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:38:18,097 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:18,543 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2022-04-28 04:38:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:38:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:38:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:38:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 04:38:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-28 04:38:18,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-28 04:38:18,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:18,622 INFO L225 Difference]: With dead ends: 131 [2022-04-28 04:38:18,622 INFO L226 Difference]: Without dead ends: 118 [2022-04-28 04:38:18,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:38:18,622 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:38:18,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:38:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-28 04:38:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-04-28 04:38:18,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:38:18,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:38:18,878 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:38:18,878 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:38:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:18,880 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-04-28 04:38:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-04-28 04:38:18,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:38:18,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:38:18,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-28 04:38:18,881 INFO L87 Difference]: Start difference. First operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 118 states. [2022-04-28 04:38:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:18,883 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-04-28 04:38:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-04-28 04:38:18,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:38:18,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:38:18,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:38:18,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:38:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.1204819277108433) internal successors, (93), 85 states have internal predecessors, (93), 18 states have call successors, (18), 12 states have call predecessors, (18), 11 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 04:38:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2022-04-28 04:38:18,885 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 50 [2022-04-28 04:38:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:38:18,885 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2022-04-28 04:38:18,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 5 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:18,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 127 transitions. [2022-04-28 04:38:21,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 126 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-28 04:38:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:38:21,149 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:38:21,149 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:38:21,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 04:38:21,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:38:21,360 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:38:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:38:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 11 times [2022-04-28 04:38:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:38:21,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233950520] [2022-04-28 04:38:21,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:38:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1452517941, now seen corresponding path program 12 times [2022-04-28 04:38:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:38:21,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171013942] [2022-04-28 04:38:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:38:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:38:21,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:38:21,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531206599] [2022-04-28 04:38:21,373 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:38:21,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:38:21,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:38:21,374 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:38:21,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 04:38:21,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:38:21,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:38:21,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 04:38:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:38:21,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:38:21,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #69#return; {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret8 := main(); {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L272 TraceCheckUtils]: 6: Hoare triple {10224#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:21,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:21,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:21,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10224#true} {10224#true} #61#return; {10224#true} is VALID [2022-04-28 04:38:21,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {10224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10224#true} is VALID [2022-04-28 04:38:21,996 INFO L272 TraceCheckUtils]: 12: Hoare triple {10224#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:21,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {10224#true} ~cond := #in~cond; {10268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:38:21,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {10268#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:38:21,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {10272#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10272#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:38:22,000 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10272#(not (= |assume_abort_if_not_#in~cond| 0))} {10224#true} #63#return; {10279#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {10279#(and (<= 0 main_~Y~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,001 INFO L272 TraceCheckUtils]: 19: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,002 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10224#true} {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {10283#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10308#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {10308#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,004 INFO L272 TraceCheckUtils]: 28: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,005 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10224#true} {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {10312#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= 0 main_~Y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10337#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {10337#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,008 INFO L272 TraceCheckUtils]: 37: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,009 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10224#true} {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} #65#return; {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:38:22,010 INFO L290 TraceCheckUtils]: 43: Hoare triple {10341#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= main_~Y~0 10))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10366#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:38:22,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {10366#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ (- 2) main_~x~0) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10370#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ main_~x~0 (- 3)) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:38:22,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {10370#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= (+ main_~x~0 (- 3)) 0) (= (+ (- 2) main_~y~0) 0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10374#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:38:22,012 INFO L272 TraceCheckUtils]: 46: Hoare triple {10374#(and (< (* main_~Y~0 4) (* main_~X~0 3)) (= main_~xy~0 (* main_~X~0 2)) (= (* main_~Y~0 3) main_~yx~0) (<= 0 main_~Y~0) (<= main_~Y~0 10) (= (+ (* main_~X~0 (- 3)) (* main_~Y~0 6)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:38:22,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:38:22,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {10382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10225#false} is VALID [2022-04-28 04:38:22,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-28 04:38:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 04:38:22,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:38:22,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {10225#false} assume !false; {10225#false} is VALID [2022-04-28 04:38:22,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {10382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10225#false} is VALID [2022-04-28 04:38:22,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:38:22,676 INFO L272 TraceCheckUtils]: 46: Hoare triple {10398#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:38:22,677 INFO L290 TraceCheckUtils]: 45: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10398#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:38:22,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:22,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:38:22,681 INFO L290 TraceCheckUtils]: 42: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:22,681 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10224#true} {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #65#return; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:22,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,682 INFO L290 TraceCheckUtils]: 38: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,682 INFO L272 TraceCheckUtils]: 37: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:22,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10402#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:38:22,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {10406#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:38:22,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:38:22,685 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10224#true} {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:38:22,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,685 INFO L272 TraceCheckUtils]: 28: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:38:22,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {10462#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {10437#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:38:22,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10462#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))))} is VALID [2022-04-28 04:38:22,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !!(~x~0 <= ~X~0); {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-28 04:38:22,691 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10224#true} {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} #65#return; {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-28 04:38:22,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,691 INFO L272 TraceCheckUtils]: 19: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-28 04:38:22,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {10224#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {10466#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 4) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~Y~0 2))) (not (< (+ main_~v~0 (* main_~Y~0 2)) (* main_~X~0 2))))} is VALID [2022-04-28 04:38:22,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10224#true} {10224#true} #63#return; {10224#true} is VALID [2022-04-28 04:38:22,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,703 INFO L272 TraceCheckUtils]: 12: Hoare triple {10224#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {10224#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {10224#true} is VALID [2022-04-28 04:38:22,703 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10224#true} {10224#true} #61#return; {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {10224#true} assume !(0 == ~cond); {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {10224#true} ~cond := #in~cond; {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L272 TraceCheckUtils]: 6: Hoare triple {10224#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L290 TraceCheckUtils]: 5: Hoare triple {10224#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {10224#true} call #t~ret8 := main(); {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10224#true} {10224#true} #69#return; {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {10224#true} assume true; {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {10224#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {10224#true} call ULTIMATE.init(); {10224#true} is VALID [2022-04-28 04:38:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 04:38:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:38:22,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171013942] [2022-04-28 04:38:22,705 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:38:22,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531206599] [2022-04-28 04:38:22,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531206599] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:38:22,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:38:22,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 21 [2022-04-28 04:38:22,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:38:22,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233950520] [2022-04-28 04:38:22,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233950520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:38:22,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:38:22,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:38:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541500212] [2022-04-28 04:38:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:38:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:38:22,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:38:22,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:22,741 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-28 04:38:22,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:38:22,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:38:22,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:38:22,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:38:22,742 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:23,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:23,949 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-04-28 04:38:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:38:23,949 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:38:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:38:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-28 04:38:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-28 04:38:23,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-28 04:38:24,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:24,020 INFO L225 Difference]: With dead ends: 126 [2022-04-28 04:38:24,020 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 04:38:24,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:38:24,021 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:38:24,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:38:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 04:38:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2022-04-28 04:38:24,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:38:24,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:38:24,280 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:38:24,280 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:38:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:24,282 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-04-28 04:38:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-04-28 04:38:24,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:38:24,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:38:24,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 124 states. [2022-04-28 04:38:24,282 INFO L87 Difference]: Start difference. First operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 124 states. [2022-04-28 04:38:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:38:24,285 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-04-28 04:38:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2022-04-28 04:38:24,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:38:24,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:38:24,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:38:24,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:38:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 91 states have internal predecessors, (98), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:38:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2022-04-28 04:38:24,287 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 50 [2022-04-28 04:38:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:38:24,287 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2022-04-28 04:38:24,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:38:24,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 134 transitions. [2022-04-28 04:38:26,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 133 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:38:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2022-04-28 04:38:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:38:26,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:38:26,557 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:38:26,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 04:38:26,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 04:38:26,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:38:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:38:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 13 times [2022-04-28 04:38:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:38:26,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661998825] [2022-04-28 04:38:26,766 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:38:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1343557775, now seen corresponding path program 14 times [2022-04-28 04:38:26,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:38:26,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248030325] [2022-04-28 04:38:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:38:26,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:38:26,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:38:26,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690586959] [2022-04-28 04:38:26,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:38:26,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:38:26,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:38:26,777 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:38:26,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 04:38:26,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:38:26,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:38:26,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 04:38:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:38:26,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:38:46,063 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:38:50,947 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:38:56,862 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:39:09,978 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:39:16,720 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:39:50,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {11290#true} call ULTIMATE.init(); {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11290#true} {11290#true} #69#return; {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {11290#true} call #t~ret8 := main(); {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {11290#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11290#true} {11290#true} #61#return; {11290#true} is VALID [2022-04-28 04:39:50,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {11290#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11290#true} is VALID [2022-04-28 04:39:50,558 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:50,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:50,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:50,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:50,558 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11290#true} {11290#true} #63#return; {11290#true} is VALID [2022-04-28 04:39:50,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 04:39:50,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 04:39:50,559 INFO L272 TraceCheckUtils]: 19: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:50,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:50,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:50,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:50,559 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11290#true} {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} #65#return; {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 04:39:50,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !!(~x~0 <= ~X~0); {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} is VALID [2022-04-28 04:39:50,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {11346#(= (+ main_~X~0 main_~v~0) (* main_~Y~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-28 04:39:50,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-28 04:39:52,564 WARN L290 TraceCheckUtils]: 27: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} is UNKNOWN [2022-04-28 04:39:52,564 INFO L272 TraceCheckUtils]: 28: Hoare triple {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:52,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {11290#true} ~cond := #in~cond; {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:39:52,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:39:52,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:39:52,565 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11378#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))))} #65#return; {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-28 04:39:52,566 INFO L290 TraceCheckUtils]: 33: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !!(~x~0 <= ~X~0); {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} is VALID [2022-04-28 04:39:52,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {11371#(= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} is VALID [2022-04-28 04:39:52,567 INFO L290 TraceCheckUtils]: 35: Hoare triple {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} is VALID [2022-04-28 04:39:52,567 INFO L290 TraceCheckUtils]: 36: Hoare triple {11402#(= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:39:52,567 INFO L272 TraceCheckUtils]: 37: Hoare triple {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:52,568 INFO L290 TraceCheckUtils]: 38: Hoare triple {11290#true} ~cond := #in~cond; {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:39:52,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {11385#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:39:52,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:39:52,569 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11409#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:39:52,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:39:52,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {11425#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {11432#(and (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:39:52,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {11432#(and (= (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11436#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} is VALID [2022-04-28 04:39:54,594 WARN L290 TraceCheckUtils]: 45: Hoare triple {11436#(and (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11440#(or (and (not (= main_~X~0 0)) (or (and (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 4) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) main_~v~0) (= (mod (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0))) (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) 0) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2)))) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (* main_~X~0 2))) (not (= main_~Y~0 0))))))} is UNKNOWN [2022-04-28 04:39:54,603 INFO L272 TraceCheckUtils]: 46: Hoare triple {11440#(or (and (not (= main_~X~0 0)) (or (and (= (+ (* main_~Y~0 2 (+ (- 1) (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0))) (* (- 1) main_~X~0) (* main_~Y~0 4) (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) main_~v~0) (= (mod (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) 0) (= (* (div (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0))) (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= (+ (* (- 2) main_~X~0) (* main_~Y~0 3) (* (div main_~xy~0 main_~X~0) main_~X~0)) 0) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0))) (= (mod main_~xy~0 main_~X~0) 0)) (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2)))) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (= (* main_~Y~0 3) (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (* main_~X~0 2))) (not (= main_~Y~0 0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:39:54,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:39:54,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {11448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11291#false} is VALID [2022-04-28 04:39:54,605 INFO L290 TraceCheckUtils]: 49: Hoare triple {11291#false} assume !false; {11291#false} is VALID [2022-04-28 04:39:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 04:39:54,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:39:55,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {11291#false} assume !false; {11291#false} is VALID [2022-04-28 04:39:55,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {11448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11291#false} is VALID [2022-04-28 04:39:55,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:39:55,717 INFO L272 TraceCheckUtils]: 46: Hoare triple {11464#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:39:55,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11464#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:39:55,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {11472#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:39:55,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {11472#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:39:55,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:39:55,722 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} {11482#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {11468#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:39:55,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:39:55,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {11492#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:39:55,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {11290#true} ~cond := #in~cond; {11492#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:39:55,723 INFO L272 TraceCheckUtils]: 37: Hoare triple {11482#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:55,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11482#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:39:55,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {11290#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {11290#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {11290#true} assume !!(~x~0 <= ~X~0); {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11290#true} {11290#true} #65#return; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L272 TraceCheckUtils]: 28: Hoare triple {11290#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {11290#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {11290#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {11290#true} assume !!(~x~0 <= ~X~0); {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11290#true} {11290#true} #65#return; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:55,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L272 TraceCheckUtils]: 19: Hoare triple {11290#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {11290#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11290#true} {11290#true} #63#return; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {11290#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {11290#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11290#true} {11290#true} #61#return; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {11290#true} assume !(0 == ~cond); {11290#true} is VALID [2022-04-28 04:39:55,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {11290#true} ~cond := #in~cond; {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {11290#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {11290#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {11290#true} call #t~ret8 := main(); {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11290#true} {11290#true} #69#return; {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {11290#true} assume true; {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {11290#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {11290#true} call ULTIMATE.init(); {11290#true} is VALID [2022-04-28 04:39:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 04:39:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:39:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248030325] [2022-04-28 04:39:55,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:39:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690586959] [2022-04-28 04:39:55,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690586959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:39:55,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:39:55,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2022-04-28 04:39:55,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:39:55,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661998825] [2022-04-28 04:39:55,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661998825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:39:55,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:39:55,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:39:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222797879] [2022-04-28 04:39:55,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:39:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:39:55,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:39:55,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:39:59,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:39:59,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:39:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:39:59,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:39:59,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=327, Unknown=1, NotChecked=0, Total=380 [2022-04-28 04:39:59,777 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:05,647 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-28 04:40:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:40:05,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:40:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:40:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-28 04:40:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 65 transitions. [2022-04-28 04:40:05,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 65 transitions. [2022-04-28 04:40:09,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:40:09,734 INFO L225 Difference]: With dead ends: 134 [2022-04-28 04:40:09,734 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 04:40:09,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=80, Invalid=471, Unknown=1, NotChecked=0, Total=552 [2022-04-28 04:40:09,735 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:40:09,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 211 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 354 Invalid, 0 Unknown, 45 Unchecked, 1.6s Time] [2022-04-28 04:40:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 04:40:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-28 04:40:10,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:40:10,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:10,000 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:10,001 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:10,003 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-28 04:40:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-28 04:40:10,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:40:10,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:40:10,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-28 04:40:10,003 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-28 04:40:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:10,005 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-28 04:40:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-28 04:40:10,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:40:10,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:40:10,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:40:10,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:40:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-28 04:40:10,007 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-28 04:40:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:40:10,008 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-28 04:40:10,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:10,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-28 04:40:14,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:40:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-28 04:40:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 04:40:14,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:40:14,306 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:40:14,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 04:40:14,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 04:40:14,507 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:40:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:40:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 5 times [2022-04-28 04:40:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:40:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541906080] [2022-04-28 04:40:14,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:40:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 431449587, now seen corresponding path program 6 times [2022-04-28 04:40:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:40:14,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059660169] [2022-04-28 04:40:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:40:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:40:14,517 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:40:14,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204871039] [2022-04-28 04:40:14,517 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:40:14,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:40:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:40:14,518 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:40:14,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 04:40:14,564 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 04:40:14,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:40:14,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 04:40:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:40:14,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:40:19,023 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:40:30,162 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:40:30,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {12391#true} call ULTIMATE.init(); {12391#true} is VALID [2022-04-28 04:40:30,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {12391#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12391#true} is VALID [2022-04-28 04:40:30,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:30,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#true} {12391#true} #69#return; {12391#true} is VALID [2022-04-28 04:40:30,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#true} call #t~ret8 := main(); {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12391#true} {12391#true} #61#return; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L272 TraceCheckUtils]: 12: Hoare triple {12391#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:30,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12391#true} {12391#true} #63#return; {12391#true} is VALID [2022-04-28 04:40:30,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:40:30,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:40:30,429 INFO L272 TraceCheckUtils]: 19: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:30,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:30,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:30,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:30,430 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12391#true} {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:40:30,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:40:30,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {12447#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12472#(and (= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-28 04:40:30,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {12472#(and (= main_~x~0 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12476#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-28 04:40:30,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {12476#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} is VALID [2022-04-28 04:40:30,432 INFO L272 TraceCheckUtils]: 28: Hoare triple {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:30,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {12391#true} ~cond := #in~cond; {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:40:30,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:40:30,433 INFO L290 TraceCheckUtils]: 31: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:40:30,434 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12480#(and (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~y~0 1))} #65#return; {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-28 04:40:30,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} is VALID [2022-04-28 04:40:30,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {12498#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (<= main_~y~0 1))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12505#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= main_~x~0 1))} is VALID [2022-04-28 04:40:30,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {12505#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= main_~x~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12509#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2))} is VALID [2022-04-28 04:40:30,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {12509#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:40:30,436 INFO L272 TraceCheckUtils]: 37: Hoare triple {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:30,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {12391#true} ~cond := #in~cond; {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:40:30,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {12487#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:40:30,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:40:30,438 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12513#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {12529#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:40:30,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {12529#(and (= (+ (- 1) main_~x~0) 1) (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {12533#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 2) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-28 04:40:30,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {12533#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 2) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12537#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= main_~x~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} is VALID [2022-04-28 04:40:30,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {12537#(and (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= main_~x~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12541#(and (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= (+ (- 1) main_~x~0) 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} is VALID [2022-04-28 04:40:30,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {12541#(and (= (+ (* main_~Y~0 8) (* main_~X~0 (- 7))) main_~v~0) (= (+ (- 1) main_~x~0) 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 (+ (- 1) main_~y~0)) 2) (* main_~Y~0 6) (* main_~X~0 (- 4)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12545#(and (= (* main_~Y~0 8) (+ main_~v~0 (* 7 main_~X~0))) (= (* main_~Y~0 3) main_~yx~0) (<= 2 main_~X~0) (= (* main_~X~0 (div (* main_~X~0 3) main_~X~0)) main_~xy~0))} is VALID [2022-04-28 04:40:30,444 INFO L272 TraceCheckUtils]: 46: Hoare triple {12545#(and (= (* main_~Y~0 8) (+ main_~v~0 (* 7 main_~X~0))) (= (* main_~Y~0 3) main_~yx~0) (<= 2 main_~X~0) (= (* main_~X~0 (div (* main_~X~0 3) main_~X~0)) main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:40:30,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:40:30,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12392#false} is VALID [2022-04-28 04:40:30,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {12392#false} assume !false; {12392#false} is VALID [2022-04-28 04:40:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 04:40:30,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:40:35,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {12392#false} assume !false; {12392#false} is VALID [2022-04-28 04:40:35,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {12553#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12392#false} is VALID [2022-04-28 04:40:35,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12553#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:40:35,137 INFO L272 TraceCheckUtils]: 46: Hoare triple {12569#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12549#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:40:35,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12569#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:40:35,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {12577#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:40:35,142 INFO L290 TraceCheckUtils]: 43: Hoare triple {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12577#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:40:35,143 INFO L290 TraceCheckUtils]: 42: Hoare triple {12584#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {12573#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:40:35,144 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} {12588#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {12584#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:40:35,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:40:35,144 INFO L290 TraceCheckUtils]: 39: Hoare triple {12598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {12491#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:40:35,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {12391#true} ~cond := #in~cond; {12598#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:40:35,145 INFO L272 TraceCheckUtils]: 37: Hoare triple {12588#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12588#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {12391#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 34: Hoare triple {12391#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {12391#true} assume !!(~x~0 <= ~X~0); {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12391#true} {12391#true} #65#return; {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 31: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 30: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L272 TraceCheckUtils]: 28: Hoare triple {12391#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:35,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {12391#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {12391#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {12391#true} assume !!(~x~0 <= ~X~0); {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12391#true} {12391#true} #65#return; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 21: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L272 TraceCheckUtils]: 19: Hoare triple {12391#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {12391#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {12391#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12391#true} {12391#true} #63#return; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:35,147 INFO L272 TraceCheckUtils]: 12: Hoare triple {12391#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {12391#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12391#true} {12391#true} #61#return; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {12391#true} assume !(0 == ~cond); {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {12391#true} ~cond := #in~cond; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {12391#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {12391#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {12391#true} call #t~ret8 := main(); {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12391#true} {12391#true} #69#return; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {12391#true} assume true; {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {12391#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {12391#true} call ULTIMATE.init(); {12391#true} is VALID [2022-04-28 04:40:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 04:40:35,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:40:35,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059660169] [2022-04-28 04:40:35,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:40:35,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204871039] [2022-04-28 04:40:35,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204871039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:40:35,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:40:35,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 25 [2022-04-28 04:40:35,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:40:35,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541906080] [2022-04-28 04:40:35,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541906080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:40:35,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:40:35,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:40:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392939850] [2022-04-28 04:40:35,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:40:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:40:35,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:40:35,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:35,195 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-28 04:40:35,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:40:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:40:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:40:35,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:40:35,196 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:39,094 INFO L93 Difference]: Finished difference Result 134 states and 151 transitions. [2022-04-28 04:40:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:40:39,094 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-04-28 04:40:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:40:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-28 04:40:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2022-04-28 04:40:39,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2022-04-28 04:40:39,166 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-28 04:40:39,167 INFO L225 Difference]: With dead ends: 134 [2022-04-28 04:40:39,167 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 04:40:39,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:40:39,168 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:40:39,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 256 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:40:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 04:40:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-28 04:40:39,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:40:39,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:39,441 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:39,441 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:39,442 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-28 04:40:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-28 04:40:39,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:40:39,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:40:39,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-28 04:40:39,443 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 132 states. [2022-04-28 04:40:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:39,445 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2022-04-28 04:40:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2022-04-28 04:40:39,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:40:39,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:40:39,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:40:39,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:40:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-28 04:40:39,447 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 50 [2022-04-28 04:40:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:40:39,447 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-28 04:40:39,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 1.875) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:40:39,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-28 04:40:43,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:40:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-28 04:40:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 04:40:43,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:40:43,784 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:40:43,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 04:40:43,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 04:40:43,985 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:40:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:40:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 3 times [2022-04-28 04:40:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:40:43,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564162707] [2022-04-28 04:40:43,986 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:40:43,986 INFO L85 PathProgramCache]: Analyzing trace with hash 55892592, now seen corresponding path program 4 times [2022-04-28 04:40:43,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:40:43,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477394916] [2022-04-28 04:40:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:40:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:40:44,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:40:44,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967608624] [2022-04-28 04:40:44,003 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:40:44,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:40:44,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:40:44,020 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:40:44,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 04:40:44,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:40:44,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:40:44,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 04:40:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:40:44,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:40:44,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {13501#true} call ULTIMATE.init(); {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {13501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13501#true} {13501#true} #69#return; {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {13501#true} call #t~ret8 := main(); {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {13501#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {13501#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:44,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13501#true} {13501#true} #61#return; {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L272 TraceCheckUtils]: 12: Hoare triple {13501#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13501#true} {13501#true} #63#return; {13501#true} is VALID [2022-04-28 04:40:44,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {13501#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:40:44,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:40:44,972 INFO L272 TraceCheckUtils]: 19: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:44,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:44,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:44,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,972 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13501#true} {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #65#return; {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:40:44,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:40:44,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {13557#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13582#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:40:44,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {13582#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:40:44,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:40:44,976 INFO L272 TraceCheckUtils]: 28: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:44,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:44,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:44,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,976 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13501#true} {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #65#return; {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:40:44,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-28 04:40:44,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {13586#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13611#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {13611#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,979 INFO L272 TraceCheckUtils]: 37: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:44,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:44,979 INFO L290 TraceCheckUtils]: 39: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:44,979 INFO L290 TraceCheckUtils]: 40: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,979 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13501#true} {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !!(~x~0 <= ~X~0); {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {13615#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,981 INFO L272 TraceCheckUtils]: 46: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:44,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:44,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:44,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:44,982 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13501#true} {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} #65#return; {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-28 04:40:44,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {13643#(and (<= main_~x~0 3) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {13502#false} is VALID [2022-04-28 04:40:44,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {13502#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13502#false} is VALID [2022-04-28 04:40:44,983 INFO L272 TraceCheckUtils]: 53: Hoare triple {13502#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13502#false} is VALID [2022-04-28 04:40:44,983 INFO L290 TraceCheckUtils]: 54: Hoare triple {13502#false} ~cond := #in~cond; {13502#false} is VALID [2022-04-28 04:40:44,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {13502#false} assume 0 == ~cond; {13502#false} is VALID [2022-04-28 04:40:44,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {13502#false} assume !false; {13502#false} is VALID [2022-04-28 04:40:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 04:40:44,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:40:45,314 INFO L290 TraceCheckUtils]: 56: Hoare triple {13502#false} assume !false; {13502#false} is VALID [2022-04-28 04:40:45,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {13502#false} assume 0 == ~cond; {13502#false} is VALID [2022-04-28 04:40:45,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {13502#false} ~cond := #in~cond; {13502#false} is VALID [2022-04-28 04:40:45,315 INFO L272 TraceCheckUtils]: 53: Hoare triple {13502#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {13502#false} is VALID [2022-04-28 04:40:45,315 INFO L290 TraceCheckUtils]: 52: Hoare triple {13502#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {13502#false} is VALID [2022-04-28 04:40:45,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {13695#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {13502#false} is VALID [2022-04-28 04:40:45,316 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13501#true} {13695#(<= main_~x~0 main_~X~0)} #65#return; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 04:40:45,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:45,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:45,316 INFO L272 TraceCheckUtils]: 46: Hoare triple {13695#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:45,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {13695#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 04:40:45,318 INFO L290 TraceCheckUtils]: 44: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13695#(<= main_~x~0 main_~X~0)} is VALID [2022-04-28 04:40:45,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 04:40:45,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume !!(~x~0 <= ~X~0); {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 04:40:45,319 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13501#true} {13717#(<= (+ main_~x~0 1) main_~X~0)} #65#return; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 04:40:45,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:45,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:45,319 INFO L272 TraceCheckUtils]: 37: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:45,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {13717#(<= (+ main_~x~0 1) main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 04:40:45,320 INFO L290 TraceCheckUtils]: 35: Hoare triple {13745#(<= (+ main_~x~0 2) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13717#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-28 04:40:45,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13745#(<= (+ main_~x~0 2) main_~X~0)} is VALID [2022-04-28 04:40:45,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !!(~x~0 <= ~X~0); {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 04:40:45,321 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13501#true} {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #65#return; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 04:40:45,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:45,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:45,321 INFO L272 TraceCheckUtils]: 28: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:45,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 04:40:45,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {13774#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {13749#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-28 04:40:45,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {13774#(or (< main_~v~0 0) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-28 04:40:45,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !!(~x~0 <= ~X~0); {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-28 04:40:45,324 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13501#true} {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} #65#return; {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-28 04:40:45,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:45,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:45,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:45,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {13501#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {13778#(or (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)) (<= (+ main_~x~0 3) main_~X~0))} is VALID [2022-04-28 04:40:45,326 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {13501#true} {13501#true} #63#return; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L272 TraceCheckUtils]: 12: Hoare triple {13501#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {13501#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13501#true} {13501#true} #61#return; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {13501#true} assume !(0 == ~cond); {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {13501#true} ~cond := #in~cond; {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L272 TraceCheckUtils]: 6: Hoare triple {13501#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {13501#true} is VALID [2022-04-28 04:40:45,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {13501#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {13501#true} is VALID [2022-04-28 04:40:45,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {13501#true} call #t~ret8 := main(); {13501#true} is VALID [2022-04-28 04:40:45,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13501#true} {13501#true} #69#return; {13501#true} is VALID [2022-04-28 04:40:45,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {13501#true} assume true; {13501#true} is VALID [2022-04-28 04:40:45,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {13501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {13501#true} is VALID [2022-04-28 04:40:45,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {13501#true} call ULTIMATE.init(); {13501#true} is VALID [2022-04-28 04:40:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 04:40:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:40:45,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477394916] [2022-04-28 04:40:45,327 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:40:45,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967608624] [2022-04-28 04:40:45,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967608624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:40:45,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:40:45,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 04:40:45,328 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:40:45,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564162707] [2022-04-28 04:40:45,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564162707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:40:45,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:40:45,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:40:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943722538] [2022-04-28 04:40:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:40:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-28 04:40:45,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:40:45,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:40:45,366 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-28 04:40:45,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:40:45,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:40:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:40:45,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:40:45,367 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:40:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:46,000 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-28 04:40:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:40:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 57 [2022-04-28 04:40:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:40:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:40:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 04:40:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:40:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-28 04:40:46,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-28 04:40:46,062 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-28 04:40:46,064 INFO L225 Difference]: With dead ends: 133 [2022-04-28 04:40:46,064 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 04:40:46,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:40:46,065 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:40:46,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:40:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 04:40:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-04-28 04:40:46,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:40:46,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:46,358 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:46,358 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:46,360 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-28 04:40:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-28 04:40:46,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:40:46,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:40:46,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 125 states. [2022-04-28 04:40:46,360 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) Second operand 125 states. [2022-04-28 04:40:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:40:46,362 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-28 04:40:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-04-28 04:40:46,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:40:46,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:40:46,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:40:46,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:40:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 92 states have internal predecessors, (100), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:40:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 136 transitions. [2022-04-28 04:40:46,364 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 136 transitions. Word has length 57 [2022-04-28 04:40:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:40:46,364 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 136 transitions. [2022-04-28 04:40:46,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 6 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:40:46,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 136 transitions. [2022-04-28 04:40:50,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 134 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:40:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 136 transitions. [2022-04-28 04:40:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 04:40:50,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:40:50,701 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:40:50,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 04:40:50,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:40:50,908 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:40:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:40:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 5 times [2022-04-28 04:40:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:40:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912700908] [2022-04-28 04:40:50,909 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:40:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1124973290, now seen corresponding path program 6 times [2022-04-28 04:40:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:40:50,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114390514] [2022-04-28 04:40:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:40:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:40:50,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:40:50,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862255973] [2022-04-28 04:40:50,917 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:40:50,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:40:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:40:50,918 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:40:50,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 04:40:50,962 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 04:40:50,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:40:50,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 04:40:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:40:50,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:41:04,018 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:41:07,916 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:41:10,749 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:41:15,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {14614#true} call ULTIMATE.init(); {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {14614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14614#true} {14614#true} #69#return; {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {14614#true} call #t~ret8 := main(); {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {14614#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {14614#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:15,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14614#true} {14614#true} #61#return; {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {14614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L272 TraceCheckUtils]: 12: Hoare triple {14614#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14614#true} {14614#true} #63#return; {14614#true} is VALID [2022-04-28 04:41:15,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 04:41:15,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 04:41:15,816 INFO L272 TraceCheckUtils]: 19: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:15,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:15,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:15,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:15,817 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14614#true} {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} #65#return; {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 04:41:15,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {14670#(and (<= 0 main_~x~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {14692#(and (<= 0 main_~X~0) (= main_~y~0 0))} is VALID [2022-04-28 04:41:15,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {14692#(and (<= 0 main_~X~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,819 INFO L272 TraceCheckUtils]: 28: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:15,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:15,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:15,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:15,819 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14614#true} {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,821 INFO L272 TraceCheckUtils]: 37: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:15,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:15,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:15,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:15,821 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14614#true} {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} #65#return; {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {14696#(and (= main_~y~0 1) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {14748#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {14748#(and (<= main_~x~0 main_~X~0) (= main_~y~0 1) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14752#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} is VALID [2022-04-28 04:41:15,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {14752#(and (= main_~y~0 2) (<= main_~x~0 main_~X~0) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14756#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:41:15,823 INFO L290 TraceCheckUtils]: 45: Hoare triple {14756#(and (= main_~y~0 2) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14760#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:41:15,823 INFO L272 TraceCheckUtils]: 46: Hoare triple {14760#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:15,824 INFO L290 TraceCheckUtils]: 47: Hoare triple {14614#true} ~cond := #in~cond; {14767#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:41:15,824 INFO L290 TraceCheckUtils]: 48: Hoare triple {14767#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:41:15,824 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:41:15,826 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} {14760#(and (= main_~y~0 2) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {14778#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:41:15,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {14778#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {14782#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:41:17,829 WARN L290 TraceCheckUtils]: 52: Hoare triple {14782#(and (= main_~y~0 2) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14786#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} is UNKNOWN [2022-04-28 04:41:17,831 INFO L272 TraceCheckUtils]: 53: Hoare triple {14786#(and (= main_~y~0 2) (or (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)))) (and (= (mod main_~xy~0 main_~y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0))) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:41:17,831 INFO L290 TraceCheckUtils]: 54: Hoare triple {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:41:17,832 INFO L290 TraceCheckUtils]: 55: Hoare triple {14794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14615#false} is VALID [2022-04-28 04:41:17,832 INFO L290 TraceCheckUtils]: 56: Hoare triple {14615#false} assume !false; {14615#false} is VALID [2022-04-28 04:41:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-28 04:41:17,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:41:33,085 INFO L290 TraceCheckUtils]: 56: Hoare triple {14615#false} assume !false; {14615#false} is VALID [2022-04-28 04:41:33,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {14794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14615#false} is VALID [2022-04-28 04:41:33,086 INFO L290 TraceCheckUtils]: 54: Hoare triple {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:41:33,087 INFO L272 TraceCheckUtils]: 53: Hoare triple {14810#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {14790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:41:33,088 INFO L290 TraceCheckUtils]: 52: Hoare triple {14814#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {14810#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:41:33,088 INFO L290 TraceCheckUtils]: 51: Hoare triple {14818#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {14814#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:41:33,089 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} {14822#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {14818#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:41:33,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:41:33,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {14832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:41:33,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {14614#true} ~cond := #in~cond; {14832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:41:33,090 INFO L272 TraceCheckUtils]: 46: Hoare triple {14822#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:33,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {14839#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14822#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:41:33,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {14843#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14839#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-28 04:41:33,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {14847#(forall ((main_~Y~0 Int) (v_main_~x~0_74 Int)) (or (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_74 (+ main_~y~0 1))) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)))) (<= v_main_~x~0_74 main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14843#(forall ((v_main_~x~0_74 Int)) (or (forall ((main_~Y~0 Int)) (= (+ (* (* v_main_~x~0_74 main_~y~0) 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 main_~y~0) (- 2))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0))))) (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14847#(forall ((main_~Y~0 Int) (v_main_~x~0_74 Int)) (or (not (<= v_main_~x~0_74 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_74 (+ main_~y~0 1))) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* v_main_~x~0_74 main_~Y~0)))) (<= v_main_~x~0_74 main_~X~0)))} is VALID [2022-04-28 04:41:33,098 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 40: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L272 TraceCheckUtils]: 37: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {14614#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {14614#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14614#true} is VALID [2022-04-28 04:41:33,098 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L272 TraceCheckUtils]: 28: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {14614#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {14614#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {14614#true} assume !!(~x~0 <= ~X~0); {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14614#true} {14614#true} #65#return; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:33,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {14614#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {14614#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14614#true} {14614#true} #63#return; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L272 TraceCheckUtils]: 12: Hoare triple {14614#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {14614#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14614#true} {14614#true} #61#return; {14614#true} is VALID [2022-04-28 04:41:33,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {14614#true} assume !(0 == ~cond); {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {14614#true} ~cond := #in~cond; {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L272 TraceCheckUtils]: 6: Hoare triple {14614#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {14614#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {14614#true} call #t~ret8 := main(); {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14614#true} {14614#true} #69#return; {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {14614#true} assume true; {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {14614#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {14614#true} call ULTIMATE.init(); {14614#true} is VALID [2022-04-28 04:41:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 04:41:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:41:33,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114390514] [2022-04-28 04:41:33,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:41:33,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862255973] [2022-04-28 04:41:33,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862255973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:41:33,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:41:33,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-28 04:41:33,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:41:33,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912700908] [2022-04-28 04:41:33,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912700908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:41:33,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:41:33,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:41:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476864028] [2022-04-28 04:41:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:41:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-28 04:41:33,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:41:33,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:41:34,639 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-28 04:41:34,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:41:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:41:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:41:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:41:34,640 INFO L87 Difference]: Start difference. First operand 121 states and 136 transitions. Second operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:41:37,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:41,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:48,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:49,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:51,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:53,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:55,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:57,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:41:59,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:42:02,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:42:04,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:42:04,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:04,493 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2022-04-28 04:42:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:42:04,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-28 04:42:04,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:42:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:42:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-28 04:42:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:42:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-28 04:42:04,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-28 04:42:08,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 70 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:08,090 INFO L225 Difference]: With dead ends: 168 [2022-04-28 04:42:08,090 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 04:42:08,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:42:08,091 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 9 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:42:08,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 269 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 534 Invalid, 9 Unknown, 0 Unchecked, 21.6s Time] [2022-04-28 04:42:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 04:42:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2022-04-28 04:42:08,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:42:08,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:42:08,494 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:42:08,494 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:42:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:08,496 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-28 04:42:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-28 04:42:08,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:42:08,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:42:08,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 160 states. [2022-04-28 04:42:08,497 INFO L87 Difference]: Start difference. First operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 160 states. [2022-04-28 04:42:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:42:08,500 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2022-04-28 04:42:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2022-04-28 04:42:08,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:42:08,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:42:08,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:42:08,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:42:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.1551724137931034) internal successors, (134), 119 states have internal predecessors, (134), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-28 04:42:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2022-04-28 04:42:08,503 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 57 [2022-04-28 04:42:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:42:08,503 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2022-04-28 04:42:08,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:42:08,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 184 transitions. [2022-04-28 04:42:11,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 183 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:42:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2022-04-28 04:42:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 04:42:11,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:42:11,032 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:42:11,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 04:42:11,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:42:11,235 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:42:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:42:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 5 times [2022-04-28 04:42:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:42:11,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479369893] [2022-04-28 04:42:11,236 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:42:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -680465044, now seen corresponding path program 6 times [2022-04-28 04:42:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:42:11,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687295282] [2022-04-28 04:42:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:42:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:42:11,244 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:42:11,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [947013961] [2022-04-28 04:42:11,245 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:42:11,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:42:11,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:42:11,245 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:42:11,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 04:42:11,467 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 04:42:11,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:42:11,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 04:42:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:42:11,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:42:24,399 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:42:27,918 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:42:31,650 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:44:41,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {15961#true} call ULTIMATE.init(); {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {15961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15961#true} {15961#true} #69#return; {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {15961#true} call #t~ret8 := main(); {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {15961#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L272 TraceCheckUtils]: 6: Hoare triple {15961#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:41,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {15961#true} ~cond := #in~cond; {15987#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:44:41,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {15987#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15991#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:44:41,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {15991#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15991#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:44:41,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15991#(not (= |assume_abort_if_not_#in~cond| 0))} {15961#true} #61#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,951 INFO L272 TraceCheckUtils]: 12: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:41,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:41,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:41,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:41,951 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,952 INFO L272 TraceCheckUtils]: 19: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:41,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:41,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:41,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:41,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15961#true} {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} #65#return; {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {16020#(and (<= main_~X~0 10) (<= 0 main_~x~0) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,954 INFO L272 TraceCheckUtils]: 28: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:41,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:41,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:41,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:41,955 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #65#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,956 INFO L290 TraceCheckUtils]: 35: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,956 INFO L272 TraceCheckUtils]: 37: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:41,956 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:41,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:41,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:41,957 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15961#true} {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #65#return; {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,957 INFO L290 TraceCheckUtils]: 42: Hoare triple {15998#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume !!(~x~0 <= ~X~0); {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,958 INFO L290 TraceCheckUtils]: 43: Hoare triple {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:44:41,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {16096#(and (<= main_~x~0 main_~X~0) (<= main_~X~0 10) (<= 0 main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16103#(and (<= main_~X~0 10) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:44:41,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {16103#(and (<= main_~X~0 10) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16107#(and (<= main_~X~0 10) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:44:41,960 INFO L272 TraceCheckUtils]: 46: Hoare triple {16107#(and (<= main_~X~0 10) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:41,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#true} ~cond := #in~cond; {16114#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:44:41,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {16114#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:44:41,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:44:41,963 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} {16107#(and (<= main_~X~0 10) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #65#return; {16125#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:44:41,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {16125#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {16129#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-28 04:44:42,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {16129#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {16133#(and (<= main_~X~0 10) (<= 0 main_~X~0) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-28 04:44:42,060 INFO L272 TraceCheckUtils]: 53: Hoare triple {16133#(and (<= main_~X~0 10) (<= 0 main_~X~0) (or (and (or (and (= (mod main_~xy~0 main_~y~0) 0) (not (= main_~y~0 0)) (<= (div main_~xy~0 main_~y~0) (+ main_~X~0 1)) (< main_~X~0 (div main_~xy~0 main_~y~0))) (and (= main_~xy~0 0) (= main_~y~0 0))) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) (+ main_~X~0 1)) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:44:42,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:44:42,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {16141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15962#false} is VALID [2022-04-28 04:44:42,061 INFO L290 TraceCheckUtils]: 56: Hoare triple {15962#false} assume !false; {15962#false} is VALID [2022-04-28 04:44:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 04:44:42,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:44:55,612 INFO L290 TraceCheckUtils]: 56: Hoare triple {15962#false} assume !false; {15962#false} is VALID [2022-04-28 04:44:55,612 INFO L290 TraceCheckUtils]: 55: Hoare triple {16141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15962#false} is VALID [2022-04-28 04:44:55,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:44:55,613 INFO L272 TraceCheckUtils]: 53: Hoare triple {16157#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {16137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:44:55,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {16161#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {16157#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:44:55,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {16165#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {16161#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:44:55,616 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} {16169#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {16165#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:44:55,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:44:55,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {16179#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {16118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:44:55,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {15961#true} ~cond := #in~cond; {16179#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:44:55,617 INFO L272 TraceCheckUtils]: 46: Hoare triple {16169#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:55,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {16186#(or (<= main_~x~0 main_~X~0) (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {16169#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:44:55,621 INFO L290 TraceCheckUtils]: 44: Hoare triple {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {16186#(or (<= main_~x~0 main_~X~0) (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-28 04:44:55,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} is VALID [2022-04-28 04:44:55,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {16190#(forall ((v_main_~x~0_76 Int)) (or (forall ((main_~y~0 Int) (main_~Y~0 Int)) (= (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* (* v_main_~x~0_76 main_~y~0) 2)) (+ (* 2 (* v_main_~x~0_76 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)))) (not (<= v_main_~x~0_76 (+ main_~x~0 1))) (<= v_main_~x~0_76 main_~X~0)))} is VALID [2022-04-28 04:44:55,625 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-28 04:44:55,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:55,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:55,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L272 TraceCheckUtils]: 37: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {15961#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {15961#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L272 TraceCheckUtils]: 28: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {15961#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {15961#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15961#true} is VALID [2022-04-28 04:44:55,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {15961#true} assume !!(~x~0 <= ~X~0); {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15961#true} {15961#true} #65#return; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L272 TraceCheckUtils]: 19: Hoare triple {15961#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {15961#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {15961#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {15961#true} {15961#true} #63#return; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L272 TraceCheckUtils]: 12: Hoare triple {15961#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {15961#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15961#true} {15961#true} #61#return; {15961#true} is VALID [2022-04-28 04:44:55,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {15961#true} assume !(0 == ~cond); {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {15961#true} ~cond := #in~cond; {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {15961#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {15961#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {15961#true} call #t~ret8 := main(); {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15961#true} {15961#true} #69#return; {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#true} assume true; {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {15961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {15961#true} call ULTIMATE.init(); {15961#true} is VALID [2022-04-28 04:44:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 04:44:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:44:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687295282] [2022-04-28 04:44:55,629 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:44:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947013961] [2022-04-28 04:44:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947013961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:44:55,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:44:55,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2022-04-28 04:44:55,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:44:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479369893] [2022-04-28 04:44:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479369893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:44:55,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:44:55,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:44:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843140048] [2022-04-28 04:44:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:44:55,630 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-28 04:44:55,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:44:55,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:44:55,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:44:55,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:44:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:44:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:44:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:44:55,740 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:45:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:45:01,094 INFO L93 Difference]: Finished difference Result 163 states and 191 transitions. [2022-04-28 04:45:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:45:01,094 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2022-04-28 04:45:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:45:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:45:01,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-28 04:45:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:45:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-04-28 04:45:01,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 40 transitions. [2022-04-28 04:45:01,317 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-28 04:45:01,319 INFO L225 Difference]: With dead ends: 163 [2022-04-28 04:45:01,319 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 04:45:01,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=206, Invalid=984, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:45:01,320 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:45:01,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 140 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 04:45:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 04:45:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2022-04-28 04:45:01,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:45:01,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:45:01,602 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:45:01,602 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:45:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:45:01,605 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-28 04:45:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-28 04:45:01,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:45:01,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:45:01,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 155 states. [2022-04-28 04:45:01,605 INFO L87 Difference]: Start difference. First operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) Second operand 155 states. [2022-04-28 04:45:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:45:01,607 INFO L93 Difference]: Finished difference Result 155 states and 178 transitions. [2022-04-28 04:45:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2022-04-28 04:45:01,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:45:01,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:45:01,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:45:01,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:45:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 90 states have internal predecessors, (94), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 04:45:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2022-04-28 04:45:01,609 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 57 [2022-04-28 04:45:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:45:01,609 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2022-04-28 04:45:01,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:45:01,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 129 transitions. [2022-04-28 04:45:03,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 128 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:45:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2022-04-28 04:45:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:45:03,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:45:03,925 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:45:03,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 04:45:04,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 04:45:04,131 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:45:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:45:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 7 times [2022-04-28 04:45:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:45:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [78968984] [2022-04-28 04:45:04,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:45:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1830651545, now seen corresponding path program 8 times [2022-04-28 04:45:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:45:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754415276] [2022-04-28 04:45:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:45:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:45:04,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:45:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552666652] [2022-04-28 04:45:04,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:45:04,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:45:04,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:45:04,142 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:45:04,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 04:45:04,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:45:04,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:45:04,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 04:45:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:45:04,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:45:04,821 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:45:09,855 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:45:23,582 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:45:27,796 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:45:28,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {17219#true} call ULTIMATE.init(); {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {17219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17219#true} {17219#true} #69#return; {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {17219#true} call #t~ret8 := main(); {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {17219#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:28,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#true} ~cond := #in~cond; {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:45:28,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:45:28,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:45:28,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} {17219#true} #61#return; {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:45:28,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:45:28,397 INFO L272 TraceCheckUtils]: 12: Hoare triple {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:28,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {17219#true} ~cond := #in~cond; {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:45:28,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {17245#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:45:28,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {17249#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:45:28,398 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17249#(not (= |assume_abort_if_not_#in~cond| 0))} {17256#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {17275#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {17275#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,399 INFO L272 TraceCheckUtils]: 19: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:28,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-28 04:45:28,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-28 04:45:28,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:28,400 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17219#true} {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {17279#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17304#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {17304#(and (= main_~x~0 0) (<= main_~X~0 10) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17308#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {17308#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,402 INFO L272 TraceCheckUtils]: 28: Hoare triple {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:28,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:45:28,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:28,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:28,404 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17312#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} #65#return; {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {17330#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17337#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {17337#(and (<= main_~X~0 10) (<= 1 main_~x~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 6)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 4))) (= main_~y~0 0) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17341#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {17341#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,407 INFO L272 TraceCheckUtils]: 37: Hoare triple {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:28,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:45:28,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:28,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:28,409 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17345#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} #65#return; {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {17361#(and (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17368#(and (<= main_~X~0 10) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 6)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:45:28,411 INFO L290 TraceCheckUtils]: 44: Hoare triple {17368#(and (<= main_~X~0 10) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 6)) (<= 0 main_~Y~0) (<= 2 main_~x~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17372#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {17372#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,411 INFO L272 TraceCheckUtils]: 46: Hoare triple {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:28,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {17219#true} ~cond := #in~cond; {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:45:28,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {17319#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:28,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:28,413 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17376#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (<= 3 main_~x~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~Y~0 10))} #65#return; {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:45:28,415 INFO L290 TraceCheckUtils]: 52: Hoare triple {17392#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 8)) (<= main_~X~0 10) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= 3 main_~x~0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17399#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 3 main_~x~0))} is VALID [2022-04-28 04:45:28,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {17399#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* main_~Y~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 3 main_~x~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17403#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))) (<= 4 main_~x~0))} is VALID [2022-04-28 04:45:28,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {17403#(and (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)) (* main_~Y~0 4))) (<= 4 main_~x~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17407#(and (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 4 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (= main_~xy~0 0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0))} is VALID [2022-04-28 04:45:28,423 INFO L272 TraceCheckUtils]: 55: Hoare triple {17407#(and (or (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (* main_~Y~0 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) main_~yx~0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (<= 4 (div (+ (* (- 1) main_~Y~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2))) main_~Y~0)) (not (= main_~Y~0 0)))) (= main_~xy~0 0) (<= main_~X~0 10) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:45:28,423 INFO L290 TraceCheckUtils]: 56: Hoare triple {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:45:28,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {17415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17220#false} is VALID [2022-04-28 04:45:28,424 INFO L290 TraceCheckUtils]: 58: Hoare triple {17220#false} assume !false; {17220#false} is VALID [2022-04-28 04:45:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 04:45:28,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:45:33,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {17220#false} assume !false; {17220#false} is VALID [2022-04-28 04:45:33,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {17415#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {17220#false} is VALID [2022-04-28 04:45:33,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17415#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:45:33,622 INFO L272 TraceCheckUtils]: 55: Hoare triple {17431#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17411#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:45:33,623 INFO L290 TraceCheckUtils]: 54: Hoare triple {17435#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17431#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:45:33,625 INFO L290 TraceCheckUtils]: 53: Hoare triple {17439#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17435#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:45:33,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17439#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:45:33,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !!(~x~0 <= ~X~0); {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:45:33,627 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} {17450#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} #65#return; {17443#(or (not (< main_~v~0 0)) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:45:33,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:33,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {17460#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17323#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:45:33,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {17219#true} ~cond := #in~cond; {17460#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:45:33,628 INFO L272 TraceCheckUtils]: 46: Hoare triple {17450#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:33,629 INFO L290 TraceCheckUtils]: 45: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17450#(or (not (< main_~v~0 0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-28 04:45:33,629 INFO L290 TraceCheckUtils]: 44: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-28 04:45:33,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-28 04:45:33,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-28 04:45:33,629 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-28 04:45:33,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L272 TraceCheckUtils]: 37: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 30: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L272 TraceCheckUtils]: 28: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {17219#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {17219#true} is VALID [2022-04-28 04:45:33,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {17219#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {17219#true} assume !!(~x~0 <= ~X~0); {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17219#true} {17219#true} #65#return; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L272 TraceCheckUtils]: 19: Hoare triple {17219#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {17219#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {17219#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17219#true} {17219#true} #63#return; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L272 TraceCheckUtils]: 12: Hoare triple {17219#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {17219#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {17219#true} is VALID [2022-04-28 04:45:33,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17219#true} {17219#true} #61#return; {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {17219#true} assume !(0 == ~cond); {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {17219#true} ~cond := #in~cond; {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L272 TraceCheckUtils]: 6: Hoare triple {17219#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {17219#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {17219#true} call #t~ret8 := main(); {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17219#true} {17219#true} #69#return; {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {17219#true} assume true; {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {17219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {17219#true} call ULTIMATE.init(); {17219#true} is VALID [2022-04-28 04:45:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 04:45:33,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:45:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754415276] [2022-04-28 04:45:33,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:45:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552666652] [2022-04-28 04:45:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552666652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:45:33,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:45:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 11] total 32 [2022-04-28 04:45:33,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:45:33,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [78968984] [2022-04-28 04:45:33,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [78968984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:45:33,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:45:33,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:45:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197175374] [2022-04-28 04:45:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:45:33,634 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 04:45:33,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:45:33,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:45:33,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:45:33,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 04:45:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:45:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 04:45:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:45:33,690 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:45:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:45:37,067 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2022-04-28 04:45:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:45:37,067 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 04:45:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:45:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:45:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-04-28 04:45:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:45:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 84 transitions. [2022-04-28 04:45:37,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 84 transitions. [2022-04-28 04:45:37,186 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-28 04:45:37,188 INFO L225 Difference]: With dead ends: 153 [2022-04-28 04:45:37,188 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 04:45:37,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 04:45:37,189 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:45:37,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 125 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 04:45:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 04:45:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 04:45:37,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:45:37,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:45:37,533 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:45:37,533 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:45:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:45:37,534 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-28 04:45:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-28 04:45:37,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:45:37,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:45:37,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-28 04:45:37,544 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 132 states. [2022-04-28 04:45:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:45:37,545 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2022-04-28 04:45:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-28 04:45:37,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:45:37,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:45:37,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:45:37,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:45:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:45:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-04-28 04:45:37,547 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 59 [2022-04-28 04:45:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:45:37,547 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-04-28 04:45:37,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:45:37,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 144 transitions. [2022-04-28 04:45:39,485 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-28 04:45:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-28 04:45:39,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:45:39,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:45:39,487 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:45:39,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 04:45:39,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 04:45:39,703 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:45:39,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:45:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 15 times [2022-04-28 04:45:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:45:39,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1741251928] [2022-04-28 04:45:39,704 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:45:39,704 INFO L85 PathProgramCache]: Analyzing trace with hash -689308389, now seen corresponding path program 16 times [2022-04-28 04:45:39,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:45:39,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580514696] [2022-04-28 04:45:39,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:45:39,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:45:39,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:45:39,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1682264098] [2022-04-28 04:45:39,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:45:39,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:45:39,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:45:39,714 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:45:39,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 04:45:39,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:45:39,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:45:39,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 04:45:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:45:39,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:46:12,593 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:46:13,253 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:46:36,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {18454#true} call ULTIMATE.init(); {18454#true} is VALID [2022-04-28 04:46:36,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18454#true} is VALID [2022-04-28 04:46:36,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:36,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18454#true} {18454#true} #69#return; {18454#true} is VALID [2022-04-28 04:46:36,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {18454#true} call #t~ret8 := main(); {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {18454#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {18454#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18454#true} {18454#true} #61#return; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L272 TraceCheckUtils]: 12: Hoare triple {18454#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:36,397 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18454#true} {18454#true} #63#return; {18454#true} is VALID [2022-04-28 04:46:36,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:36,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:36,398 INFO L272 TraceCheckUtils]: 19: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:36,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:36,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:36,398 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:36,399 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18454#true} {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:36,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:36,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {18510#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:46:36,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:46:38,403 WARN L290 TraceCheckUtils]: 27: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is UNKNOWN [2022-04-28 04:46:38,404 INFO L272 TraceCheckUtils]: 28: Hoare triple {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:38,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:38,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:38,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:38,406 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18542#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} #65#return; {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:46:38,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume !!(~x~0 <= ~X~0); {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} is VALID [2022-04-28 04:46:38,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {18535#(and (= main_~y~0 0) (= (+ main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (* main_~Y~0 2)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:38,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:40,410 WARN L290 TraceCheckUtils]: 36: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-28 04:46:40,410 INFO L272 TraceCheckUtils]: 37: Hoare triple {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:40,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:40,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:40,411 INFO L290 TraceCheckUtils]: 40: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:40,412 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18573#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:40,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:46:40,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {18566#(and (= (+ main_~X~0 main_~v~0 (* main_~Y~0 (- 4))) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,413 INFO L290 TraceCheckUtils]: 44: Hoare triple {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {18595#(and (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,414 INFO L272 TraceCheckUtils]: 46: Hoare triple {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:40,414 INFO L290 TraceCheckUtils]: 47: Hoare triple {18454#true} ~cond := #in~cond; {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:40,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {18549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:40,415 INFO L290 TraceCheckUtils]: 49: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:40,416 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18602#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #65#return; {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,416 INFO L290 TraceCheckUtils]: 51: Hoare triple {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !!(~x~0 <= ~X~0); {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {18618#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0) (= main_~v~0 (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18625#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {18625#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18629#(and (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} is VALID [2022-04-28 04:46:40,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {18629#(and (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= (+ main_~X~0 (* main_~Y~0 2) (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18633#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0))) (= main_~X~0 main_~xy~0))} is VALID [2022-04-28 04:46:40,428 INFO L272 TraceCheckUtils]: 55: Hoare triple {18633#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* main_~Y~0 2)) (+ (* main_~Y~0 8) (* (- 1) main_~X~0))) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0))) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:46:40,429 INFO L290 TraceCheckUtils]: 56: Hoare triple {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:40,429 INFO L290 TraceCheckUtils]: 57: Hoare triple {18641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18455#false} is VALID [2022-04-28 04:46:40,429 INFO L290 TraceCheckUtils]: 58: Hoare triple {18455#false} assume !false; {18455#false} is VALID [2022-04-28 04:46:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 04:46:40,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:46:44,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {18455#false} assume !false; {18455#false} is VALID [2022-04-28 04:46:44,707 INFO L290 TraceCheckUtils]: 57: Hoare triple {18641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18455#false} is VALID [2022-04-28 04:46:44,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:46:44,708 INFO L272 TraceCheckUtils]: 55: Hoare triple {18657#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:46:44,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18657#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:46:44,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {18665#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:46:44,714 INFO L290 TraceCheckUtils]: 52: Hoare triple {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18665#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:46:44,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:46:44,715 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} {18675#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {18661#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:46:44,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:44,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {18685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {18553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:46:44,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {18454#true} ~cond := #in~cond; {18685#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:46:44,716 INFO L272 TraceCheckUtils]: 46: Hoare triple {18675#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:44,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18675#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:46:44,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-28 04:46:44,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L272 TraceCheckUtils]: 37: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:44,718 INFO L272 TraceCheckUtils]: 28: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {18454#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {18454#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {18454#true} assume !!(~x~0 <= ~X~0); {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18454#true} {18454#true} #65#return; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L272 TraceCheckUtils]: 19: Hoare triple {18454#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {18454#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {18454#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18454#true} {18454#true} #63#return; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:44,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L272 TraceCheckUtils]: 12: Hoare triple {18454#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {18454#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18454#true} {18454#true} #61#return; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {18454#true} assume !(0 == ~cond); {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {18454#true} ~cond := #in~cond; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {18454#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {18454#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {18454#true} call #t~ret8 := main(); {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18454#true} {18454#true} #69#return; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {18454#true} assume true; {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {18454#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {18454#true} is VALID [2022-04-28 04:46:44,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {18454#true} call ULTIMATE.init(); {18454#true} is VALID [2022-04-28 04:46:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 04:46:44,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:46:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580514696] [2022-04-28 04:46:44,721 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:46:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682264098] [2022-04-28 04:46:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682264098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:46:44,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:46:44,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2022-04-28 04:46:44,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:46:44,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1741251928] [2022-04-28 04:46:44,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1741251928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:46:44,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:46:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:46:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146006059] [2022-04-28 04:46:44,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:46:44,722 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-28 04:46:44,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:46:44,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:46:48,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:46:48,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:46:48,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:46:48,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:46:48,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:46:48,794 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:46:51,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:46:54,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:46:55,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:46:55,919 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2022-04-28 04:46:55,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:46:55,919 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-28 04:46:55,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:46:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:46:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-28 04:46:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:46:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-28 04:46:55,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2022-04-28 04:47:00,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:47:00,029 INFO L225 Difference]: With dead ends: 143 [2022-04-28 04:47:00,029 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 04:47:00,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:47:00,030 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:47:00,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 241 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2022-04-28 04:47:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 04:47:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2022-04-28 04:47:00,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:47:00,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:47:00,367 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:47:00,367 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:47:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:47:00,369 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-04-28 04:47:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-04-28 04:47:00,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:47:00,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:47:00,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 141 states. [2022-04-28 04:47:00,370 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand 141 states. [2022-04-28 04:47:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:47:00,371 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-04-28 04:47:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2022-04-28 04:47:00,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:47:00,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:47:00,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:47:00,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:47:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.0918367346938775) internal successors, (107), 101 states have internal predecessors, (107), 19 states have call successors, (19), 15 states have call predecessors, (19), 14 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 04:47:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2022-04-28 04:47:00,373 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 59 [2022-04-28 04:47:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:47:00,373 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2022-04-28 04:47:00,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:47:00,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 144 transitions. [2022-04-28 04:47:02,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 143 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:47:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2022-04-28 04:47:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:47:02,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:47:02,765 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:47:02,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 04:47:02,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:47:02,965 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:47:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:47:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 17 times [2022-04-28 04:47:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:47:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1955880460] [2022-04-28 04:47:02,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:47:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 809583191, now seen corresponding path program 18 times [2022-04-28 04:47:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:47:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116247948] [2022-04-28 04:47:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:47:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:47:02,975 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:47:02,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629659391] [2022-04-28 04:47:02,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:47:02,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:47:02,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:47:02,976 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:47:02,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 04:47:03,022 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 04:47:03,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:47:03,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 04:47:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:47:03,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:47:18,169 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:47:23,545 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:47:23,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {19669#true} call ULTIMATE.init(); {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {19669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19669#true} {19669#true} #69#return; {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {19669#true} call #t~ret8 := main(); {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {19669#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {19669#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:23,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {19669#true} ~cond := #in~cond; {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:47:23,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:47:23,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:47:23,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} {19669#true} #61#return; {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:47:23,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} is VALID [2022-04-28 04:47:23,885 INFO L272 TraceCheckUtils]: 12: Hoare triple {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:23,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {19669#true} ~cond := #in~cond; {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 04:47:23,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {19695#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:47:23,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {19699#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 04:47:23,886 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19699#(not (= |assume_abort_if_not_#in~cond| 0))} {19706#(and (<= main_~X~0 10) (<= 0 main_~X~0))} #63#return; {19725#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {19725#(and (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~Y~0 10))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:23,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:23,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:23,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:23,888 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19669#true} {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} #65#return; {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {19729#(and (= main_~x~0 0) (<= main_~X~0 10) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19754#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {19754#(and (= main_~x~0 0) (<= main_~X~0 10) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,890 INFO L272 TraceCheckUtils]: 28: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:23,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:23,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:23,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:23,891 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19669#true} {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} #65#return; {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume !!(~x~0 <= ~X~0); {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} is VALID [2022-04-28 04:47:23,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {19758#(and (<= main_~X~0 10) (<= main_~x~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))) (<= main_~Y~0 10))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19783#(and (<= main_~X~0 10) (<= main_~x~0 1) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} is VALID [2022-04-28 04:47:23,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {19783#(and (<= main_~X~0 10) (<= main_~x~0 1) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-28 04:47:23,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-28 04:47:23,894 INFO L272 TraceCheckUtils]: 37: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:23,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:23,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:23,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:23,894 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19669#true} {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} #65#return; {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-28 04:47:23,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !!(~x~0 <= ~X~0); {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} is VALID [2022-04-28 04:47:23,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {19787#(and (<= main_~X~0 10) (< (* main_~Y~0 4) main_~X~0) (<= 0 main_~Y~0) (= main_~y~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 6)) (<= main_~x~0 2))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19812#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 2))} is VALID [2022-04-28 04:47:23,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {19812#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 2))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19816#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-28 04:47:23,897 INFO L290 TraceCheckUtils]: 45: Hoare triple {19816#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:47:23,897 INFO L272 TraceCheckUtils]: 46: Hoare triple {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:23,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {19669#true} ~cond := #in~cond; {19827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:47:23,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {19827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:47:23,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:47:23,899 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} {19820#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-28 04:47:23,900 INFO L290 TraceCheckUtils]: 51: Hoare triple {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume !!(~x~0 <= ~X~0); {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} is VALID [2022-04-28 04:47:23,900 INFO L290 TraceCheckUtils]: 52: Hoare triple {19838#(and (<= main_~X~0 10) (<= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< (* main_~Y~0 4) main_~X~0) (<= main_~x~0 3))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19845#(and (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (<= main_~x~0 3) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-28 04:47:23,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {19845#(and (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (<= main_~x~0 3) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19849#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (<= main_~x~0 4) (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-28 04:47:23,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {19849#(and (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0 (* (- 2) main_~Y~0)) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))) (<= main_~x~0 4) (<= main_~X~0 10) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19853#(and (= (+ (* main_~Y~0 2) (* (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0) 2)) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (<= main_~X~0 10) (<= (div main_~yx~0 main_~Y~0) 4) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (= (mod main_~yx~0 main_~Y~0) 0))} is VALID [2022-04-28 04:47:23,907 INFO L272 TraceCheckUtils]: 55: Hoare triple {19853#(and (= (+ (* main_~Y~0 2) (* (* (+ (div main_~yx~0 main_~Y~0) (- 1)) main_~Y~0) 2)) (+ main_~v~0 (* main_~X~0 3) (* (- 2) main_~Y~0))) (<= main_~X~0 10) (<= (div main_~yx~0 main_~Y~0) 4) (<= main_~X~0 (* main_~Y~0 6)) (< (* main_~Y~0 4) main_~X~0) (= main_~X~0 main_~xy~0) (<= (* main_~Y~0 10) (+ main_~v~0 (* main_~X~0 3))) (= (mod main_~yx~0 main_~Y~0) 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:47:23,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:47:23,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {19861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19670#false} is VALID [2022-04-28 04:47:23,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {19670#false} assume !false; {19670#false} is VALID [2022-04-28 04:47:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 04:47:23,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:47:28,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {19670#false} assume !false; {19670#false} is VALID [2022-04-28 04:47:28,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {19861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19670#false} is VALID [2022-04-28 04:47:28,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:47:28,760 INFO L272 TraceCheckUtils]: 55: Hoare triple {19877#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:47:28,761 INFO L290 TraceCheckUtils]: 54: Hoare triple {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19877#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:47:28,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {19885#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:47:28,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19885#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:47:28,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:47:28,765 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} {19895#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {19881#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:47:28,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:47:28,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {19905#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {19831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:47:28,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {19669#true} ~cond := #in~cond; {19905#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:47:28,766 INFO L272 TraceCheckUtils]: 46: Hoare triple {19895#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19895#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {19669#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L272 TraceCheckUtils]: 37: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-28 04:47:28,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {19669#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L272 TraceCheckUtils]: 28: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {19669#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {19669#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {19669#true} assume !!(~x~0 <= ~X~0); {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19669#true} {19669#true} #65#return; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:28,769 INFO L272 TraceCheckUtils]: 19: Hoare triple {19669#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {19669#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {19669#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19669#true} {19669#true} #63#return; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L272 TraceCheckUtils]: 12: Hoare triple {19669#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {19669#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19669#true} {19669#true} #61#return; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {19669#true} assume !(0 == ~cond); {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {19669#true} ~cond := #in~cond; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {19669#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {19669#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {19669#true} is VALID [2022-04-28 04:47:28,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {19669#true} call #t~ret8 := main(); {19669#true} is VALID [2022-04-28 04:47:28,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19669#true} {19669#true} #69#return; {19669#true} is VALID [2022-04-28 04:47:28,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {19669#true} assume true; {19669#true} is VALID [2022-04-28 04:47:28,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {19669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19669#true} is VALID [2022-04-28 04:47:28,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {19669#true} call ULTIMATE.init(); {19669#true} is VALID [2022-04-28 04:47:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 04:47:28,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:47:28,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116247948] [2022-04-28 04:47:28,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:47:28,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629659391] [2022-04-28 04:47:28,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629659391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:47:28,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:47:28,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 27 [2022-04-28 04:47:28,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:47:28,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1955880460] [2022-04-28 04:47:28,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1955880460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:47:28,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:47:28,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:47:28,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100124706] [2022-04-28 04:47:28,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:47:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 04:47:28,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:47:28,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:47:28,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:47:28,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:47:28,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:47:28,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:47:28,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:47:28,838 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:47:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:47:31,449 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2022-04-28 04:47:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:47:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 04:47:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:47:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:47:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 76 transitions. [2022-04-28 04:47:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:47:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 76 transitions. [2022-04-28 04:47:31,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 76 transitions. [2022-04-28 04:47:31,534 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-28 04:47:31,536 INFO L225 Difference]: With dead ends: 162 [2022-04-28 04:47:31,536 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 04:47:31,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:47:31,537 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:47:31,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 113 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 04:47:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 04:47:31,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-04-28 04:47:31,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:47:31,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:47:31,940 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:47:31,940 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:47:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:47:31,942 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-04-28 04:47:31,942 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-04-28 04:47:31,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:47:31,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:47:31,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 146 states. [2022-04-28 04:47:31,943 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) Second operand 146 states. [2022-04-28 04:47:31,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:47:31,945 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-04-28 04:47:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-04-28 04:47:31,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:47:31,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:47:31,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:47:31,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:47:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.0841121495327102) internal successors, (116), 111 states have internal predecessors, (116), 21 states have call successors, (21), 16 states have call predecessors, (21), 15 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 04:47:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2022-04-28 04:47:31,952 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 59 [2022-04-28 04:47:31,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:47:31,952 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2022-04-28 04:47:31,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 04:47:31,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 157 transitions. [2022-04-28 04:47:33,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:47:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2022-04-28 04:47:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:47:33,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:47:33,976 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:47:33,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 04:47:34,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:47:34,193 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:47:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:47:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 19 times [2022-04-28 04:47:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:47:34,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013575144] [2022-04-28 04:47:34,193 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:47:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1971200155, now seen corresponding path program 20 times [2022-04-28 04:47:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:47:34,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548841312] [2022-04-28 04:47:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:47:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:47:34,202 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:47:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2078040772] [2022-04-28 04:47:34,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:47:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:47:34,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:47:34,203 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:47:34,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 04:47:34,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:47:34,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:47:34,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 04:47:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:47:34,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:03,466 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:48:04,316 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:48:19,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {20965#true} call ULTIMATE.init(); {20965#true} is VALID [2022-04-28 04:48:19,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {20965#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {20965#true} is VALID [2022-04-28 04:48:19,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20965#true} {20965#true} #69#return; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {20965#true} call #t~ret8 := main(); {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {20965#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {20965#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20965#true} {20965#true} #61#return; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {20965#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L272 TraceCheckUtils]: 12: Hoare triple {20965#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:19,417 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20965#true} {20965#true} #63#return; {20965#true} is VALID [2022-04-28 04:48:19,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {20965#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:48:19,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:48:19,418 INFO L272 TraceCheckUtils]: 19: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:19,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:19,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:19,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:19,419 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20965#true} {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #65#return; {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:48:19,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-28 04:48:19,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {21021#(and (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:48:19,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:48:21,423 WARN L290 TraceCheckUtils]: 27: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} is UNKNOWN [2022-04-28 04:48:21,423 INFO L272 TraceCheckUtils]: 28: Hoare triple {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:21,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:21,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:21,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:21,425 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21053#(and (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0))} #65#return; {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:48:21,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-28 04:48:21,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {21046#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-28 04:48:21,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-28 04:48:23,430 WARN L290 TraceCheckUtils]: 36: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} is UNKNOWN [2022-04-28 04:48:23,430 INFO L272 TraceCheckUtils]: 37: Hoare triple {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:23,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:23,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:23,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:23,432 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21084#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (or (and (= (mod main_~yx~0 main_~Y~0) 0) (not (= main_~Y~0 0))) (= main_~yx~0 0)) (= main_~y~0 1) (= (* main_~X~0 main_~y~0) main_~xy~0))} #65#return; {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-28 04:48:23,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume !!(~x~0 <= ~X~0); {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} is VALID [2022-04-28 04:48:23,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {21077#(and (= (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 1))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:48:23,434 INFO L290 TraceCheckUtils]: 44: Hoare triple {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:48:23,434 INFO L290 TraceCheckUtils]: 45: Hoare triple {21106#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21113#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:48:23,434 INFO L272 TraceCheckUtils]: 46: Hoare triple {21113#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:23,434 INFO L290 TraceCheckUtils]: 47: Hoare triple {20965#true} ~cond := #in~cond; {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:23,435 INFO L290 TraceCheckUtils]: 48: Hoare triple {21060#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:23,435 INFO L290 TraceCheckUtils]: 49: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:23,436 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21113#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:48:23,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} is VALID [2022-04-28 04:48:23,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {21129#(and (= main_~y~0 1) (= (+ main_~v~0 (* main_~Y~0 (- 4)) (* main_~X~0 2)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21136#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= main_~y~0 1) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:48:23,449 INFO L290 TraceCheckUtils]: 53: Hoare triple {21136#(and (= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4))) (= main_~y~0 1) (= (+ (* main_~Y~0 main_~x~0 2) main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21140#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= main_~y~0 1) (= (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} is VALID [2022-04-28 04:48:23,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {21140#(and (= main_~v~0 (+ (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4) (* (+ (- 1) main_~x~0) main_~Y~0 2))) (= main_~y~0 1) (= (+ main_~X~0 (* (- 2) main_~X~0 main_~y~0) (* (+ (- 1) main_~x~0) main_~Y~0 2) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21144#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))) (= main_~X~0 main_~xy~0))} is VALID [2022-04-28 04:48:23,456 INFO L272 TraceCheckUtils]: 55: Hoare triple {21144#(and (or (and (= (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) 0) (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= main_~yx~0 0) (= main_~Y~0 0)) (and (= (mod (+ main_~X~0 main_~v~0) 2) 0) (= (* (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) main_~Y~0) main_~yx~0) (not (= main_~Y~0 0)) (= (mod (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2 (+ (div (+ (div (+ (* main_~X~0 (- 3)) (* (- 1) main_~v~0)) (- 2)) (* (- 1) main_~Y~0)) main_~Y~0) (- 1))) (* (- 2) main_~Y~0)) (+ (* (- 1) main_~X~0) (* main_~Y~0 4))))) (= main_~X~0 main_~xy~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:23,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:23,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {21152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20966#false} is VALID [2022-04-28 04:48:23,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#false} assume !false; {20966#false} is VALID [2022-04-28 04:48:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 04:48:23,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:48:26,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {20966#false} assume !false; {20966#false} is VALID [2022-04-28 04:48:26,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {21152#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20966#false} is VALID [2022-04-28 04:48:26,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21152#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:48:26,436 INFO L272 TraceCheckUtils]: 55: Hoare triple {21168#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {21148#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:48:26,436 INFO L290 TraceCheckUtils]: 54: Hoare triple {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21168#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:48:26,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {21176#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:48:26,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {21176#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:48:26,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:48:26,447 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} {21186#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {21172#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:48:26,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:26,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {21196#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {21064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:48:26,448 INFO L290 TraceCheckUtils]: 47: Hoare triple {20965#true} ~cond := #in~cond; {21196#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:48:26,448 INFO L272 TraceCheckUtils]: 46: Hoare triple {21186#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:26,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {21186#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:48:26,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-28 04:48:26,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {20965#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20965#true} is VALID [2022-04-28 04:48:26,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-28 04:48:26,449 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L272 TraceCheckUtils]: 37: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {20965#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L272 TraceCheckUtils]: 28: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-28 04:48:26,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {20965#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {20965#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {20965#true} assume !!(~x~0 <= ~X~0); {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20965#true} {20965#true} #65#return; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L272 TraceCheckUtils]: 19: Hoare triple {20965#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {20965#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {20965#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20965#true} {20965#true} #63#return; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L272 TraceCheckUtils]: 12: Hoare triple {20965#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:26,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {20965#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20965#true} {20965#true} #61#return; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {20965#true} assume !(0 == ~cond); {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {20965#true} ~cond := #in~cond; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {20965#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {20965#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {20965#true} call #t~ret8 := main(); {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20965#true} {20965#true} #69#return; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {20965#true} assume true; {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {20965#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {20965#true} call ULTIMATE.init(); {20965#true} is VALID [2022-04-28 04:48:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 04:48:26,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:48:26,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548841312] [2022-04-28 04:48:26,453 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:48:26,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078040772] [2022-04-28 04:48:26,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078040772] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:48:26,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:48:26,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 22 [2022-04-28 04:48:26,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:48:26,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013575144] [2022-04-28 04:48:26,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013575144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:48:26,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:48:26,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:48:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11842588] [2022-04-28 04:48:26,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:48:26,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-28 04:48:26,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:48:26,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:48:30,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:30,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:48:30,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:30,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:48:30,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:48:30,525 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:48:33,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:48:36,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:48:38,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:38,165 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-04-28 04:48:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:48:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-28 04:48:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:48:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:48:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-28 04:48:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:48:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 65 transitions. [2022-04-28 04:48:38,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 65 transitions. [2022-04-28 04:48:42,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:42,263 INFO L225 Difference]: With dead ends: 157 [2022-04-28 04:48:42,263 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 04:48:42,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:48:42,264 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:48:42,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 230 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 467 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 04:48:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 04:48:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2022-04-28 04:48:42,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:48:42,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:48:42,692 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:48:42,692 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:48:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:42,697 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-04-28 04:48:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-04-28 04:48:42,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:42,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:42,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 155 states. [2022-04-28 04:48:42,699 INFO L87 Difference]: Start difference. First operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 155 states. [2022-04-28 04:48:42,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:48:42,701 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-04-28 04:48:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-04-28 04:48:42,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:48:42,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:48:42,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:48:42,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:48:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.087719298245614) internal successors, (124), 118 states have internal predecessors, (124), 22 states have call successors, (22), 17 states have call predecessors, (22), 16 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:48:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2022-04-28 04:48:42,704 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 59 [2022-04-28 04:48:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:48:42,704 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2022-04-28 04:48:42,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:48:42,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 167 transitions. [2022-04-28 04:48:45,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:48:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2022-04-28 04:48:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:48:45,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:48:45,309 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:48:45,325 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-28 04:48:45,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 04:48:45,509 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:48:45,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:48:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 21 times [2022-04-28 04:48:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:48:45,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466959718] [2022-04-28 04:48:45,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:48:45,510 INFO L85 PathProgramCache]: Analyzing trace with hash -548759779, now seen corresponding path program 22 times [2022-04-28 04:48:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:48:45,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422764851] [2022-04-28 04:48:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:48:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:48:45,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:48:45,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486055020] [2022-04-28 04:48:45,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:48:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:48:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:48:45,523 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:48:45,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 04:48:45,564 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:48:45,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:48:45,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 04:48:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:48:45,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:48:45,911 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:48:52,912 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:48:59,302 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:49:03,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {22278#true} call ULTIMATE.init(); {22278#true} is VALID [2022-04-28 04:49:03,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {22278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {22278#true} is VALID [2022-04-28 04:49:03,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22278#true} {22278#true} #69#return; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {22278#true} call #t~ret8 := main(); {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {22278#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L272 TraceCheckUtils]: 6: Hoare triple {22278#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22278#true} {22278#true} #61#return; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {22278#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L272 TraceCheckUtils]: 12: Hoare triple {22278#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:03,348 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22278#true} {22278#true} #63#return; {22278#true} is VALID [2022-04-28 04:49:03,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {22278#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:49:03,349 INFO L290 TraceCheckUtils]: 18: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:49:03,349 INFO L272 TraceCheckUtils]: 19: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:03,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:03,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:03,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:03,350 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22278#true} {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #65#return; {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:49:03,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-28 04:49:03,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {22334#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22359#(and (= main_~x~0 0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:49:03,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {22359#(and (= main_~x~0 0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22363#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:49:03,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {22363#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22367#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:49:03,352 INFO L272 TraceCheckUtils]: 28: Hoare triple {22367#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:03,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:03,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:03,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:03,355 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22367#(and (<= 1 main_~x~0) (< main_~v~0 (* main_~Y~0 2)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} #65#return; {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:49:03,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} is VALID [2022-04-28 04:49:03,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {22385#(and (<= 1 main_~x~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (= main_~y~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* (- 2) main_~Y~0))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22392#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-28 04:49:03,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {22392#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22396#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} is VALID [2022-04-28 04:49:03,359 INFO L290 TraceCheckUtils]: 36: Hoare triple {22396#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} is VALID [2022-04-28 04:49:03,359 INFO L272 TraceCheckUtils]: 37: Hoare triple {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:03,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:03,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:03,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:03,361 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22400#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= (+ (div main_~Y~0 main_~Y~0) 1) main_~x~0))} #65#return; {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-28 04:49:03,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} assume !!(~x~0 <= ~X~0); {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-28 04:49:03,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {22416#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 6)) (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22423#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-28 04:49:03,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {22423#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 4)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* (- 2) main_~X~0) (* main_~Y~0 6))) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22427#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} is VALID [2022-04-28 04:49:03,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {22427#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-28 04:49:03,366 INFO L272 TraceCheckUtils]: 46: Hoare triple {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:03,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {22278#true} ~cond := #in~cond; {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:03,366 INFO L290 TraceCheckUtils]: 48: Hoare triple {22374#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:03,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:03,369 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22431#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (<= (+ (div (+ (* main_~X~0 main_~y~0) (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~Y~0) 1) main_~x~0) (<= main_~X~0 (* main_~Y~0 4)) (= main_~v~0 (+ (* main_~Y~0 8) (* main_~X~0 (- 3)))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-28 04:49:03,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} assume !!(~x~0 <= ~X~0); {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} is VALID [2022-04-28 04:49:03,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {22447#(and (< (* main_~Y~0 2) main_~X~0) (= main_~y~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ main_~v~0 (* main_~X~0 3))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22454#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)))} is VALID [2022-04-28 04:49:03,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {22454#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22458#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))))} is VALID [2022-04-28 04:49:03,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {22458#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~y~0 2) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* main_~Y~0 8) (+ (* main_~Y~0 2) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22462#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~xy~0 (* main_~X~0 2)) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0))} is VALID [2022-04-28 04:49:03,375 INFO L272 TraceCheckUtils]: 55: Hoare triple {22462#(and (= (+ (* main_~Y~0 10) (* main_~X~0 (- 5))) main_~v~0) (= main_~xy~0 (* main_~X~0 2)) (< (* main_~Y~0 2) main_~X~0) (<= main_~X~0 (* main_~Y~0 4)) (= (* (div (* main_~Y~0 4) main_~Y~0) main_~Y~0) main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:49:03,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:03,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {22470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22279#false} is VALID [2022-04-28 04:49:03,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {22279#false} assume !false; {22279#false} is VALID [2022-04-28 04:49:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 41 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-28 04:49:03,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:49:07,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {22279#false} assume !false; {22279#false} is VALID [2022-04-28 04:49:07,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {22470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22279#false} is VALID [2022-04-28 04:49:07,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:07,343 INFO L272 TraceCheckUtils]: 55: Hoare triple {22486#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:49:07,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22486#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-28 04:49:07,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {22494#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:49:07,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22494#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-28 04:49:07,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:49:07,349 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} {22504#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #65#return; {22490#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-28 04:49:07,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:07,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {22514#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22378#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:49:07,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {22278#true} ~cond := #in~cond; {22514#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:49:07,350 INFO L272 TraceCheckUtils]: 46: Hoare triple {22504#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:07,351 INFO L290 TraceCheckUtils]: 45: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22504#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-28 04:49:07,351 INFO L290 TraceCheckUtils]: 44: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {22278#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 40: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L272 TraceCheckUtils]: 37: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 36: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 35: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {22278#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 33: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 30: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:07,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L272 TraceCheckUtils]: 28: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {22278#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {22278#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {22278#true} assume !!(~x~0 <= ~X~0); {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22278#true} {22278#true} #65#return; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L272 TraceCheckUtils]: 19: Hoare triple {22278#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {22278#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {22278#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22278#true} {22278#true} #63#return; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:07,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L272 TraceCheckUtils]: 12: Hoare triple {22278#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {22278#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22278#true} {22278#true} #61#return; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {22278#true} assume !(0 == ~cond); {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {22278#true} ~cond := #in~cond; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {22278#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 10 then 1 else 0)); {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {22278#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {22278#true} call #t~ret8 := main(); {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22278#true} {22278#true} #69#return; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {22278#true} assume true; {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {22278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {22278#true} is VALID [2022-04-28 04:49:07,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {22278#true} call ULTIMATE.init(); {22278#true} is VALID [2022-04-28 04:49:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 04:49:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422764851] [2022-04-28 04:49:07,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:49:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486055020] [2022-04-28 04:49:07,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486055020] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:49:07,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:49:07,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 27 [2022-04-28 04:49:07,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:07,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466959718] [2022-04-28 04:49:07,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466959718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:07,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:07,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:49:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052244645] [2022-04-28 04:49:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-28 04:49:07,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:07,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:49:07,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:07,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:49:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:49:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:49:07,421 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:49:10,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:10,716 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2022-04-28 04:49:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:49:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 59 [2022-04-28 04:49:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:49:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2022-04-28 04:49:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:49:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 64 transitions. [2022-04-28 04:49:10,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 64 transitions. [2022-04-28 04:49:10,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:10,798 INFO L225 Difference]: With dead ends: 168 [2022-04-28 04:49:10,798 INFO L226 Difference]: Without dead ends: 166 [2022-04-28 04:49:10,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:49:10,799 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:49:10,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 269 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:49:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-28 04:49:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2022-04-28 04:49:11,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:11,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:49:11,222 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:49:11,223 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:49:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:11,225 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2022-04-28 04:49:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-04-28 04:49:11,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:11,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:11,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 166 states. [2022-04-28 04:49:11,225 INFO L87 Difference]: Start difference. First operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) Second operand 166 states. [2022-04-28 04:49:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:11,227 INFO L93 Difference]: Finished difference Result 166 states and 179 transitions. [2022-04-28 04:49:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2022-04-28 04:49:11,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:11,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:11,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:11,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 117 states have (on average 1.0854700854700854) internal successors, (127), 121 states have internal predecessors, (127), 22 states have call successors, (22), 18 states have call predecessors, (22), 17 states have return successors, (21), 17 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 04:49:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2022-04-28 04:49:11,229 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 59 [2022-04-28 04:49:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:11,230 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2022-04-28 04:49:11,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-28 04:49:11,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 170 transitions. [2022-04-28 04:49:13,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2022-04-28 04:49:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 04:49:13,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:13,247 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:13,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-28 04:49:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 04:49:13,459 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 23 times [2022-04-28 04:49:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:13,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370784089] [2022-04-28 04:49:13,460 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1434400107, now seen corresponding path program 24 times [2022-04-28 04:49:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:13,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034873765] [2022-04-28 04:49:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:13,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:13,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:49:13,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400158966] [2022-04-28 04:49:13,471 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 04:49:13,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:49:13,472 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:49:13,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 04:49:13,523 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 04:49:13,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:49:13,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 04:49:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:13,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:49:27,516 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful