/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/egcd2-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 05:43:07,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 05:43:07,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 05:43:07,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 05:43:07,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 05:43:07,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 05:43:07,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 05:43:07,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 05:43:07,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 05:43:07,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 05:43:07,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 05:43:07,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 05:43:07,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 05:43:07,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 05:43:07,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 05:43:07,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 05:43:07,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 05:43:07,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 05:43:07,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 05:43:07,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 05:43:07,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 05:43:07,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 05:43:07,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 05:43:07,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 05:43:07,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 05:43:07,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 05:43:07,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 05:43:07,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 05:43:07,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 05:43:07,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 05:43:07,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 05:43:07,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 05:43:07,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 05:43:07,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 05:43:07,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 05:43:07,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 05:43:07,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 05:43:07,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 05:43:07,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 05:43:07,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 05:43:07,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 05:43:07,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 05:43:07,935 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 05:43:07,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 05:43:07,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 05:43:07,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 05:43:07,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 05:43:07,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:43:07,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 05:43:07,948 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 05:43:07,949 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 05:43:07,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 05:43:07,949 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 05:43:07,949 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 05:43:08,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 05:43:08,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 05:43:08,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 05:43:08,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 05:43:08,119 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 05:43:08,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c [2022-04-28 05:43:08,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f039a06/87dff15effed431aba2d83306bd46f31/FLAG408b03cb5 [2022-04-28 05:43:08,523 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 05:43:08,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_valuebound5.c [2022-04-28 05:43:08,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f039a06/87dff15effed431aba2d83306bd46f31/FLAG408b03cb5 [2022-04-28 05:43:08,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f039a06/87dff15effed431aba2d83306bd46f31 [2022-04-28 05:43:08,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 05:43:08,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 05:43:08,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 05:43:08,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 05:43:08,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 05:43:08,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eaa4d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08, skipping insertion in model container [2022-04-28 05:43:08,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 05:43:08,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 05:43:08,704 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/egcd2-ll_valuebound5.c[490,503] [2022-04-28 05:43:08,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:43:08,742 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 05:43:08,749 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/egcd2-ll_valuebound5.c[490,503] [2022-04-28 05:43:08,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 05:43:08,770 INFO L208 MainTranslator]: Completed translation [2022-04-28 05:43:08,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08 WrapperNode [2022-04-28 05:43:08,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 05:43:08,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 05:43:08,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 05:43:08,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 05:43:08,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 05:43:08,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 05:43:08,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 05:43:08,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 05:43:08,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (1/1) ... [2022-04-28 05:43:08,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 05:43:08,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:08,828 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 05:43:08,850 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 05:43:08,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 05:43:08,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 05:43:08,859 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 05:43:08,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 05:43:08,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 05:43:08,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 05:43:08,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 05:43:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 05:43:08,900 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 05:43:08,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 05:43:09,022 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 05:43:09,027 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 05:43:09,027 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 05:43:09,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:43:09 BoogieIcfgContainer [2022-04-28 05:43:09,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 05:43:09,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 05:43:09,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 05:43:09,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 05:43:09,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 05:43:08" (1/3) ... [2022-04-28 05:43:09,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb708a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:43:09, skipping insertion in model container [2022-04-28 05:43:09,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 05:43:08" (2/3) ... [2022-04-28 05:43:09,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb708a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 05:43:09, skipping insertion in model container [2022-04-28 05:43:09,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 05:43:09" (3/3) ... [2022-04-28 05:43:09,033 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_valuebound5.c [2022-04-28 05:43:09,042 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 05:43:09,042 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 05:43:09,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 05:43:09,072 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@43518b54, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@276b3ed8 [2022-04-28 05:43:09,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 05:43:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 05:43:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 05:43:09,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:09,083 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:09,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:09,086 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 1 times [2022-04-28 05:43:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:09,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805714131] [2022-04-28 05:43:09,115 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -587582002, now seen corresponding path program 2 times [2022-04-28 05:43:09,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:09,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501869216] [2022-04-28 05:43:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:09,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 05:43:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 05:43:09,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:43:09,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-28 05:43:09,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 05:43:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-28 05:43:09,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 05:43:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-28 05:43:09,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 05:43:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-28 05:43:09,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-28 05:43:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-28 05:43:09,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-28 05:43:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-28 05:43:09,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 05:43:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:09,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-28 05:43:09,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 05:43:09,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {43#true} is VALID [2022-04-28 05:43:09,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-28 05:43:09,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #103#return; {43#true} is VALID [2022-04-28 05:43:09,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret6 := main(); {43#true} is VALID [2022-04-28 05:43:09,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {43#true} is VALID [2022-04-28 05:43:09,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {43#true} is VALID [2022-04-28 05:43:09,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #79#return; {44#false} is VALID [2022-04-28 05:43:09,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {44#false} is VALID [2022-04-28 05:43:09,395 INFO L272 TraceCheckUtils]: 12: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {43#true} is VALID [2022-04-28 05:43:09,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,397 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {44#false} {44#false} #81#return; {44#false} is VALID [2022-04-28 05:43:09,398 INFO L272 TraceCheckUtils]: 17: Hoare triple {44#false} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 05:43:09,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,401 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {44#false} {44#false} #83#return; {44#false} is VALID [2022-04-28 05:43:09,402 INFO L272 TraceCheckUtils]: 22: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-28 05:43:09,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,405 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {44#false} {44#false} #85#return; {44#false} is VALID [2022-04-28 05:43:09,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {44#false} is VALID [2022-04-28 05:43:09,405 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-28 05:43:09,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,406 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2022-04-28 05:43:09,406 INFO L272 TraceCheckUtils]: 33: Hoare triple {44#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {43#true} is VALID [2022-04-28 05:43:09,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-28 05:43:09,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-28 05:43:09,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-28 05:43:09,408 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2022-04-28 05:43:09,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-28 05:43:09,409 INFO L272 TraceCheckUtils]: 39: Hoare triple {44#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {44#false} is VALID [2022-04-28 05:43:09,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-28 05:43:09,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-28 05:43:09,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-28 05:43:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 05:43:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:09,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501869216] [2022-04-28 05:43:09,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501869216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:09,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:09,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:43:09,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:09,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805714131] [2022-04-28 05:43:09,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805714131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:09,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:09,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 05:43:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26893635] [2022-04-28 05:43:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:09,419 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-28 05:43:09,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:09,426 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:09,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:09,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 05:43:09,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:09,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 05:43:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 05:43:09,496 INFO L87 Difference]: Start difference. First operand has 40 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:09,673 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-28 05:43:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 05:43:09,674 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-28 05:43:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:09,675 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-28 05:43:09,693 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-04-28 05:43:09,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-04-28 05:43:09,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:09,829 INFO L225 Difference]: With dead ends: 73 [2022-04-28 05:43:09,830 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 05:43:09,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 05:43:09,836 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:09,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:43:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 05:43:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 05:43:09,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:09,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:09,875 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:09,876 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:09,885 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 05:43:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:43:09,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:09,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:09,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 05:43:09,887 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-28 05:43:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:09,889 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 05:43:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:43:09,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:09,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:09,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:09,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-28 05:43:09,893 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 43 [2022-04-28 05:43:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:09,894 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-28 05:43:09,894 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, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:09,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 46 transitions. [2022-04-28 05:43:09,946 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 05:43:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 05:43:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 05:43:09,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:09,953 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:09,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 05:43:09,953 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 1 times [2022-04-28 05:43:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:09,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714189742] [2022-04-28 05:43:09,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 987777007, now seen corresponding path program 2 times [2022-04-28 05:43:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:09,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87938580] [2022-04-28 05:43:09,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:09,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:09,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [801710329] [2022-04-28 05:43:09,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:43:09,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:09,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:09,996 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 05:43:10,020 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 05:43:10,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:43:10,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:10,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:43:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:10,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:10,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-28 05:43:10,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-28 05:43:10,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #103#return; {361#true} is VALID [2022-04-28 05:43:10,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-28 05:43:10,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {361#true} is VALID [2022-04-28 05:43:10,273 INFO L272 TraceCheckUtils]: 6: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {361#true} {361#true} #79#return; {361#true} is VALID [2022-04-28 05:43:10,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {361#true} is VALID [2022-04-28 05:43:10,274 INFO L272 TraceCheckUtils]: 12: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,275 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2022-04-28 05:43:10,275 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,275 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {361#true} {361#true} #83#return; {361#true} is VALID [2022-04-28 05:43:10,275 INFO L272 TraceCheckUtils]: 22: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,276 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} ~cond := #in~cond; {435#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:43:10,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {435#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:10,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {439#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:10,277 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {439#(not (= |assume_abort_if_not_#in~cond| 0))} {361#true} #85#return; {446#(<= 1 main_~y~0)} is VALID [2022-04-28 05:43:10,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,278 INFO L272 TraceCheckUtils]: 28: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,279 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #87#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,279 INFO L272 TraceCheckUtils]: 33: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,280 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #89#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#(<= 1 main_~b~0)} assume !false; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#(<= 1 main_~b~0)} assume !(0 != ~b~0); {362#false} is VALID [2022-04-28 05:43:10,281 INFO L272 TraceCheckUtils]: 40: Hoare triple {362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {362#false} is VALID [2022-04-28 05:43:10,281 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-28 05:43:10,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-28 05:43:10,281 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-28 05:43:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 05:43:10,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:10,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-28 05:43:10,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-28 05:43:10,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-28 05:43:10,505 INFO L272 TraceCheckUtils]: 40: Hoare triple {362#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {362#false} is VALID [2022-04-28 05:43:10,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#(<= 1 main_~b~0)} assume !(0 != ~b~0); {362#false} is VALID [2022-04-28 05:43:10,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#(<= 1 main_~b~0)} assume !false; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,511 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #89#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,512 INFO L272 TraceCheckUtils]: 33: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,512 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {361#true} {450#(<= 1 main_~b~0)} #87#return; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,513 INFO L272 TraceCheckUtils]: 28: Hoare triple {450#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {446#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {450#(<= 1 main_~b~0)} is VALID [2022-04-28 05:43:10,514 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {439#(not (= |assume_abort_if_not_#in~cond| 0))} {361#true} #85#return; {446#(<= 1 main_~y~0)} is VALID [2022-04-28 05:43:10,514 INFO L290 TraceCheckUtils]: 25: Hoare triple {439#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:10,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {559#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {439#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:43:10,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#true} ~cond := #in~cond; {559#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:43:10,515 INFO L272 TraceCheckUtils]: 22: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,515 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {361#true} {361#true} #83#return; {361#true} is VALID [2022-04-28 05:43:10,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,516 INFO L272 TraceCheckUtils]: 17: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,516 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2022-04-28 05:43:10,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,516 INFO L272 TraceCheckUtils]: 12: Hoare triple {361#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {361#true} is VALID [2022-04-28 05:43:10,517 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {361#true} {361#true} #79#return; {361#true} is VALID [2022-04-28 05:43:10,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(0 == ~cond); {361#true} is VALID [2022-04-28 05:43:10,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2022-04-28 05:43:10,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {361#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {361#true} is VALID [2022-04-28 05:43:10,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {361#true} is VALID [2022-04-28 05:43:10,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-28 05:43:10,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #103#return; {361#true} is VALID [2022-04-28 05:43:10,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-28 05:43:10,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {361#true} is VALID [2022-04-28 05:43:10,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-28 05:43:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 05:43:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87938580] [2022-04-28 05:43:10,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801710329] [2022-04-28 05:43:10,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801710329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:43:10,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:43:10,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-28 05:43:10,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:10,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714189742] [2022-04-28 05:43:10,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714189742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:10,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:10,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 05:43:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730564605] [2022-04-28 05:43:10,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-28 05:43:10,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:10,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:10,551 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 05:43:10,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 05:43:10,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:10,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 05:43:10,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:43:10,553 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:10,813 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-28 05:43:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:43:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2022-04-28 05:43:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 05:43:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-28 05:43:10,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-28 05:43:10,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:10,871 INFO L225 Difference]: With dead ends: 52 [2022-04-28 05:43:10,871 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 05:43:10,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:43:10,872 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 19 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:10,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:43:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 05:43:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-04-28 05:43:10,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:10,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:10,897 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:10,897 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:10,900 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 05:43:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-28 05:43:10,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:10,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:10,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-28 05:43:10,901 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 44 states. [2022-04-28 05:43:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:10,904 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 05:43:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 60 transitions. [2022-04-28 05:43:10,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:10,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:10,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:10,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 05:43:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-28 05:43:10,906 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 44 [2022-04-28 05:43:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:10,906 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-28 05:43:10,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-28 05:43:10,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-28 05:43:10,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-28 05:43:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 05:43:10,953 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:10,953 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:10,972 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 05:43:11,170 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 05:43:11,170 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 1 times [2022-04-28 05:43:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298900637] [2022-04-28 05:43:11,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 561616070, now seen corresponding path program 2 times [2022-04-28 05:43:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:11,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583750271] [2022-04-28 05:43:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:11,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:11,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748995689] [2022-04-28 05:43:11,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:43:11,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:11,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:11,188 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 05:43:11,189 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 05:43:11,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 05:43:11,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:11,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 05:43:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:11,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:11,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {901#true} call ULTIMATE.init(); {901#true} is VALID [2022-04-28 05:43:11,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {901#true} is VALID [2022-04-28 05:43:11,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {901#true} {901#true} #103#return; {901#true} is VALID [2022-04-28 05:43:11,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {901#true} call #t~ret6 := main(); {901#true} is VALID [2022-04-28 05:43:11,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {901#true} is VALID [2022-04-28 05:43:11,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {901#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {901#true} is VALID [2022-04-28 05:43:11,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 05:43:11,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 05:43:11,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {901#true} {901#true} #79#return; {901#true} is VALID [2022-04-28 05:43:11,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {901#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {901#true} is VALID [2022-04-28 05:43:11,396 INFO L272 TraceCheckUtils]: 12: Hoare triple {901#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {901#true} is VALID [2022-04-28 05:43:11,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 05:43:11,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 05:43:11,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,396 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {901#true} {901#true} #81#return; {901#true} is VALID [2022-04-28 05:43:11,397 INFO L272 TraceCheckUtils]: 17: Hoare triple {901#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {901#true} is VALID [2022-04-28 05:43:11,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 05:43:11,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 05:43:11,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,397 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {901#true} {901#true} #83#return; {901#true} is VALID [2022-04-28 05:43:11,397 INFO L272 TraceCheckUtils]: 22: Hoare triple {901#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {901#true} is VALID [2022-04-28 05:43:11,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 05:43:11,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 05:43:11,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,398 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {901#true} {901#true} #85#return; {901#true} is VALID [2022-04-28 05:43:11,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {901#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {901#true} is VALID [2022-04-28 05:43:11,398 INFO L272 TraceCheckUtils]: 28: Hoare triple {901#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {901#true} is VALID [2022-04-28 05:43:11,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 05:43:11,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 05:43:11,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,398 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {901#true} {901#true} #87#return; {901#true} is VALID [2022-04-28 05:43:11,398 INFO L272 TraceCheckUtils]: 33: Hoare triple {901#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {901#true} is VALID [2022-04-28 05:43:11,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {901#true} ~cond := #in~cond; {901#true} is VALID [2022-04-28 05:43:11,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {901#true} assume !(0 == ~cond); {901#true} is VALID [2022-04-28 05:43:11,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {901#true} assume true; {901#true} is VALID [2022-04-28 05:43:11,399 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {901#true} {901#true} #89#return; {901#true} is VALID [2022-04-28 05:43:11,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {901#true} assume !false; {901#true} is VALID [2022-04-28 05:43:11,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:43:11,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !false; {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-28 05:43:11,408 INFO L272 TraceCheckUtils]: 41: Hoare triple {1023#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:11,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:11,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {1034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {902#false} is VALID [2022-04-28 05:43:11,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-04-28 05:43:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 05:43:11,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:43:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:11,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583750271] [2022-04-28 05:43:11,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:11,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748995689] [2022-04-28 05:43:11,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748995689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:11,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:11,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:43:11,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:11,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298900637] [2022-04-28 05:43:11,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298900637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:11,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:11,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:43:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211157981] [2022-04-28 05:43:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-28 05:43:11,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:11,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 05:43:11,434 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 05:43:11,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:43:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:11,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:43:11,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:43:11,435 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 05:43:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:11,605 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-04-28 05:43:11,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:43:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 45 [2022-04-28 05:43:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 05:43:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 05:43:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 05:43:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-28 05:43:11,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-28 05:43:11,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:43:11,661 INFO L225 Difference]: With dead ends: 50 [2022-04-28 05:43:11,661 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 05:43:11,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:43:11,662 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:11,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:43:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 05:43:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-04-28 05:43:11,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:11,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 05:43:11,700 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 05:43:11,700 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 05:43:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:11,702 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-28 05:43:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-04-28 05:43:11,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:11,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:11,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 05:43:11,703 INFO L87 Difference]: Start difference. First operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-28 05:43:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:11,705 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-04-28 05:43:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-04-28 05:43:11,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:11,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:11,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:11,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 25 states have internal predecessors, (26), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 05:43:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-04-28 05:43:11,707 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 45 [2022-04-28 05:43:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:11,709 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-04-28 05:43:11,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-28 05:43:11,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 54 transitions. [2022-04-28 05:43:11,784 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 05:43:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-28 05:43:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 05:43:11,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:11,785 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:11,801 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 05:43:11,986 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 05:43:11,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 1 times [2022-04-28 05:43:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:11,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927269284] [2022-04-28 05:43:11,987 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash -680064098, now seen corresponding path program 2 times [2022-04-28 05:43:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:11,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977171384] [2022-04-28 05:43:11,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:11,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:12,002 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:12,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285293654] [2022-04-28 05:43:12,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:43:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:12,008 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 05:43:12,009 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 05:43:12,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:43:12,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:12,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:43:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:12,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:14,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {1324#true} call ULTIMATE.init(); {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1324#true} {1324#true} #103#return; {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {1324#true} call #t~ret6 := main(); {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {1324#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {1324#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1324#true} {1324#true} #79#return; {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {1324#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L272 TraceCheckUtils]: 12: Hoare triple {1324#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1324#true} {1324#true} #81#return; {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L272 TraceCheckUtils]: 17: Hoare triple {1324#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1324#true} {1324#true} #83#return; {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L272 TraceCheckUtils]: 22: Hoare triple {1324#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,333 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1324#true} {1324#true} #85#return; {1324#true} is VALID [2022-04-28 05:43:14,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {1324#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,335 INFO L272 TraceCheckUtils]: 28: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,335 INFO L290 TraceCheckUtils]: 30: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,336 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,336 INFO L272 TraceCheckUtils]: 33: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,339 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,345 INFO L290 TraceCheckUtils]: 39: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,345 INFO L290 TraceCheckUtils]: 40: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,345 INFO L272 TraceCheckUtils]: 41: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1324#true} is VALID [2022-04-28 05:43:14,345 INFO L290 TraceCheckUtils]: 42: Hoare triple {1324#true} ~cond := #in~cond; {1324#true} is VALID [2022-04-28 05:43:14,345 INFO L290 TraceCheckUtils]: 43: Hoare triple {1324#true} assume !(0 == ~cond); {1324#true} is VALID [2022-04-28 05:43:14,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {1324#true} assume true; {1324#true} is VALID [2022-04-28 05:43:14,347 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1324#true} {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:43:14,348 INFO L272 TraceCheckUtils]: 46: Hoare triple {1410#(and (= main_~r~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1468#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:14,348 INFO L290 TraceCheckUtils]: 47: Hoare triple {1468#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1472#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:14,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {1472#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1325#false} is VALID [2022-04-28 05:43:14,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {1325#false} assume !false; {1325#false} is VALID [2022-04-28 05:43:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-28 05:43:14,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:43:14,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:14,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977171384] [2022-04-28 05:43:14,349 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285293654] [2022-04-28 05:43:14,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285293654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:14,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:14,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:43:14,350 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:14,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927269284] [2022-04-28 05:43:14,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927269284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:14,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:14,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:43:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977736169] [2022-04-28 05:43:14,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:14,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-04-28 05:43:14,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:14,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:43:14,371 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 05:43:14,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:43:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:14,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:43:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:43:14,372 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:43:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:14,514 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-28 05:43:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:43:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2022-04-28 05:43:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:43:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:43:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:43:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:43:14,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:43:14,570 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 05:43:14,572 INFO L225 Difference]: With dead ends: 58 [2022-04-28 05:43:14,573 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 05:43:14,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:43:14,575 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:14,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:43:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 05:43:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-28 05:43:14,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:14,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:14,614 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:14,614 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:14,618 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-28 05:43:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-28 05:43:14,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:14,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:14,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 56 states. [2022-04-28 05:43:14,622 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 56 states. [2022-04-28 05:43:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:14,624 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-04-28 05:43:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2022-04-28 05:43:14,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:14,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:14,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:14,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 32 states have internal predecessors, (33), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2022-04-28 05:43:14,627 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 50 [2022-04-28 05:43:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:14,627 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2022-04-28 05:43:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-28 05:43:14,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 71 transitions. [2022-04-28 05:43:14,716 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 05:43:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-04-28 05:43:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 05:43:14,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:14,716 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:14,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 05:43:14,919 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 05:43:14,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 1 times [2022-04-28 05:43:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [187240941] [2022-04-28 05:43:14,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash 606548870, now seen corresponding path program 2 times [2022-04-28 05:43:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:14,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29799010] [2022-04-28 05:43:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:14,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:14,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316100421] [2022-04-28 05:43:14,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:43:14,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:14,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:14,944 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 05:43:14,945 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 05:43:14,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:43:14,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:14,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:43:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:15,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:15,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {1818#true} call ULTIMATE.init(); {1818#true} is VALID [2022-04-28 05:43:15,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1818#true} is VALID [2022-04-28 05:43:15,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1818#true} {1818#true} #103#return; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {1818#true} call #t~ret6 := main(); {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L272 TraceCheckUtils]: 6: Hoare triple {1818#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1818#true} {1818#true} #79#return; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {1818#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L272 TraceCheckUtils]: 12: Hoare triple {1818#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1818#true} {1818#true} #81#return; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L272 TraceCheckUtils]: 17: Hoare triple {1818#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1818#true} {1818#true} #83#return; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L272 TraceCheckUtils]: 22: Hoare triple {1818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,505 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1818#true} {1818#true} #85#return; {1818#true} is VALID [2022-04-28 05:43:15,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {1818#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,506 INFO L272 TraceCheckUtils]: 28: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,506 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #87#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,507 INFO L272 TraceCheckUtils]: 33: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,507 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #89#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,508 INFO L290 TraceCheckUtils]: 38: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,508 INFO L290 TraceCheckUtils]: 39: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,508 INFO L272 TraceCheckUtils]: 41: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,511 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #91#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,512 INFO L272 TraceCheckUtils]: 46: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1818#true} is VALID [2022-04-28 05:43:15,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {1818#true} ~cond := #in~cond; {1818#true} is VALID [2022-04-28 05:43:15,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {1818#true} assume !(0 == ~cond); {1818#true} is VALID [2022-04-28 05:43:15,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {1818#true} assume true; {1818#true} is VALID [2022-04-28 05:43:15,513 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1818#true} {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #93#return; {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-28 05:43:15,514 INFO L272 TraceCheckUtils]: 51: Hoare triple {1904#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {1977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:15,515 INFO L290 TraceCheckUtils]: 52: Hoare triple {1977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:15,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {1981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1819#false} is VALID [2022-04-28 05:43:15,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-04-28 05:43:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 05:43:15,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:43:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:15,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29799010] [2022-04-28 05:43:15,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316100421] [2022-04-28 05:43:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316100421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:15,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:15,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:43:15,519 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [187240941] [2022-04-28 05:43:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [187240941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:15,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:15,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:43:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896554961] [2022-04-28 05:43:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:15,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-28 05:43:15,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:15,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:43:15,567 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 05:43:15,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:43:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:15,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:43:15,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:43:15,568 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:43:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:15,773 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2022-04-28 05:43:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:43:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 55 [2022-04-28 05:43:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:43:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:43:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:43:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:43:15,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-28 05:43:15,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-28 05:43:15,844 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 05:43:15,847 INFO L225 Difference]: With dead ends: 62 [2022-04-28 05:43:15,847 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 05:43:15,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 05:43:15,849 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:43:15,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:43:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 05:43:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-04-28 05:43:15,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:43:15,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:15,894 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:15,895 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:15,899 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-28 05:43:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-28 05:43:15,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:15,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:15,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 60 states. [2022-04-28 05:43:15,900 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 60 states. [2022-04-28 05:43:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:43:15,903 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-04-28 05:43:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2022-04-28 05:43:15,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:43:15,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:43:15,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:43:15,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:43:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:43:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-04-28 05:43:15,907 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 55 [2022-04-28 05:43:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:43:15,908 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-04-28 05:43:15,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-28 05:43:15,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 74 transitions. [2022-04-28 05:43:15,997 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 05:43:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-04-28 05:43:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 05:43:15,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:43:15,998 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:43:16,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-28 05:43:16,211 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 05:43:16,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:43:16,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:43:16,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 1 times [2022-04-28 05:43:16,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:16,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141354503] [2022-04-28 05:43:16,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:43:16,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1584976990, now seen corresponding path program 2 times [2022-04-28 05:43:16,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:43:16,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189498909] [2022-04-28 05:43:16,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:43:16,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:43:16,225 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:43:16,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242881801] [2022-04-28 05:43:16,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:43:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:43:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:43:16,226 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 05:43:16,239 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 05:43:16,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:43:16,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:43:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 05:43:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:43:16,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:43:23,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2022-04-28 05:43:23,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-28 05:43:23,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #103#return; {2351#true} is VALID [2022-04-28 05:43:23,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret6 := main(); {2351#true} is VALID [2022-04-28 05:43:23,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2351#true} is VALID [2022-04-28 05:43:23,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {2351#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2351#true} {2351#true} #79#return; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L272 TraceCheckUtils]: 12: Hoare triple {2351#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2351#true} {2351#true} #81#return; {2351#true} is VALID [2022-04-28 05:43:23,735 INFO L272 TraceCheckUtils]: 17: Hoare triple {2351#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2351#true} {2351#true} #83#return; {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L272 TraceCheckUtils]: 22: Hoare triple {2351#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,736 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2351#true} {2351#true} #85#return; {2351#true} is VALID [2022-04-28 05:43:23,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {2351#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,737 INFO L272 TraceCheckUtils]: 28: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,738 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #87#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,738 INFO L272 TraceCheckUtils]: 33: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,739 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #89#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} assume !false; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,740 INFO L272 TraceCheckUtils]: 41: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {2351#true} ~cond := #in~cond; {2351#true} is VALID [2022-04-28 05:43:23,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {2351#true} assume !(0 == ~cond); {2351#true} is VALID [2022-04-28 05:43:23,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 05:43:23,741 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2351#true} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #91#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,741 INFO L272 TraceCheckUtils]: 46: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,741 INFO L290 TraceCheckUtils]: 47: Hoare triple {2351#true} ~cond := #in~cond; {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:23,742 INFO L290 TraceCheckUtils]: 48: Hoare triple {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:23,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:23,743 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #93#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,743 INFO L272 TraceCheckUtils]: 51: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2351#true} is VALID [2022-04-28 05:43:23,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {2351#true} ~cond := #in~cond; {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:23,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {2498#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:23,744 INFO L290 TraceCheckUtils]: 54: Hoare triple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:43:23,744 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2502#(not (= |__VERIFIER_assert_#in~cond| 0))} {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #95#return; {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} is VALID [2022-04-28 05:43:23,745 INFO L272 TraceCheckUtils]: 56: Hoare triple {2437#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:43:23,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {2527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:43:23,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {2531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2352#false} is VALID [2022-04-28 05:43:23,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-04-28 05:43:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 05:43:23,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:43:59,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:43:59,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189498909] [2022-04-28 05:43:59,900 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:43:59,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242881801] [2022-04-28 05:43:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242881801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:43:59,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:43:59,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-28 05:43:59,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:43:59,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1141354503] [2022-04-28 05:43:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1141354503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:43:59,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:43:59,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:43:59,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064347557] [2022-04-28 05:43:59,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:43:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-28 05:43:59,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:43:59,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 05:43:59,952 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 05:43:59,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:43:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:43:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:43:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:43:59,953 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 05:44:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:00,331 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-28 05:44:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 05:44:00,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2022-04-28 05:44:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 05:44:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 05:44:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 05:44:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 05:44:00,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 05:44:00,384 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 05:44:00,385 INFO L225 Difference]: With dead ends: 66 [2022-04-28 05:44:00,385 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 05:44:00,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-28 05:44:00,386 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:00,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 164 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:44:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 05:44:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-28 05:44:00,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:00,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:44:00,426 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:44:00,426 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:44:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:00,428 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-28 05:44:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 05:44:00,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:00,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:00,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-28 05:44:00,428 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-28 05:44:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:00,430 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-28 05:44:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 05:44:00,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:00,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:00,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:00,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 05:44:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 05:44:00,434 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 60 [2022-04-28 05:44:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:00,434 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-04-28 05:44:00,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-28 05:44:00,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-28 05:44:00,511 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 05:44:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-28 05:44:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 05:44:00,513 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:00,513 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:44:00,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 05:44:00,727 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 05:44:00,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -669670075, now seen corresponding path program 1 times [2022-04-28 05:44:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:00,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403790541] [2022-04-28 05:44:00,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash -669670075, now seen corresponding path program 2 times [2022-04-28 05:44:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:00,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038919901] [2022-04-28 05:44:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:00,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:00,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527816335] [2022-04-28 05:44:00,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:44:00,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:00,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:00,764 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 05:44:00,768 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 05:44:00,808 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:44:00,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:00,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 05:44:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:00,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:44:01,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {2944#true} call ULTIMATE.init(); {2944#true} is VALID [2022-04-28 05:44:01,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2944#true} is VALID [2022-04-28 05:44:01,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2944#true} {2944#true} #103#return; {2944#true} is VALID [2022-04-28 05:44:01,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {2944#true} call #t~ret6 := main(); {2944#true} is VALID [2022-04-28 05:44:01,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {2944#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2944#true} is VALID [2022-04-28 05:44:01,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,013 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2944#true} {2944#true} #79#return; {2944#true} is VALID [2022-04-28 05:44:01,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2944#true} is VALID [2022-04-28 05:44:01,014 INFO L272 TraceCheckUtils]: 12: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,016 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2944#true} {2944#true} #81#return; {2944#true} is VALID [2022-04-28 05:44:01,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2944#true} {2944#true} #83#return; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L272 TraceCheckUtils]: 22: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2944#true} {2944#true} #85#return; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {2944#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L272 TraceCheckUtils]: 28: Hoare triple {2944#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2944#true} {2944#true} #87#return; {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L272 TraceCheckUtils]: 33: Hoare triple {2944#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L290 TraceCheckUtils]: 36: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2944#true} {2944#true} #89#return; {2944#true} is VALID [2022-04-28 05:44:01,018 INFO L290 TraceCheckUtils]: 38: Hoare triple {2944#true} assume !false; {2944#true} is VALID [2022-04-28 05:44:01,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {2944#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:44:01,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !false; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:44:01,019 INFO L272 TraceCheckUtils]: 41: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,020 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #91#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:44:01,020 INFO L272 TraceCheckUtils]: 46: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,020 INFO L290 TraceCheckUtils]: 48: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,020 INFO L290 TraceCheckUtils]: 49: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,021 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #93#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:44:01,021 INFO L272 TraceCheckUtils]: 51: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,021 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #95#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:44:01,021 INFO L272 TraceCheckUtils]: 56: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,022 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2944#true} {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #97#return; {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-28 05:44:01,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {3066#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 05:44:01,024 INFO L290 TraceCheckUtils]: 62: Hoare triple {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} assume !false; {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} is VALID [2022-04-28 05:44:01,024 INFO L272 TraceCheckUtils]: 63: Hoare triple {3133#(and (= main_~a~0 (+ main_~c~0 main_~b~0)) (= (+ (- 1) main_~k~0) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:01,024 INFO L290 TraceCheckUtils]: 64: Hoare triple {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3144#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:01,025 INFO L290 TraceCheckUtils]: 65: Hoare triple {3144#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2945#false} is VALID [2022-04-28 05:44:01,025 INFO L290 TraceCheckUtils]: 66: Hoare triple {2945#false} assume !false; {2945#false} is VALID [2022-04-28 05:44:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 05:44:01,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:44:01,203 INFO L290 TraceCheckUtils]: 66: Hoare triple {2945#false} assume !false; {2945#false} is VALID [2022-04-28 05:44:01,203 INFO L290 TraceCheckUtils]: 65: Hoare triple {3144#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2945#false} is VALID [2022-04-28 05:44:01,204 INFO L290 TraceCheckUtils]: 64: Hoare triple {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3144#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:01,205 INFO L272 TraceCheckUtils]: 63: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3140#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:01,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,207 INFO L290 TraceCheckUtils]: 61: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,208 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #97#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,208 INFO L272 TraceCheckUtils]: 56: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,209 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #95#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,209 INFO L290 TraceCheckUtils]: 53: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,209 INFO L290 TraceCheckUtils]: 52: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,209 INFO L272 TraceCheckUtils]: 51: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,210 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #93#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,210 INFO L290 TraceCheckUtils]: 48: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,210 INFO L272 TraceCheckUtils]: 46: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,210 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2944#true} {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #91#return; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,210 INFO L290 TraceCheckUtils]: 44: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,211 INFO L272 TraceCheckUtils]: 41: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !false; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {2944#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3160#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-28 05:44:01,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {2944#true} assume !false; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2944#true} {2944#true} #89#return; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 36: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L272 TraceCheckUtils]: 33: Hoare triple {2944#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2944#true} {2944#true} #87#return; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L272 TraceCheckUtils]: 28: Hoare triple {2944#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {2944#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2944#true} {2944#true} #85#return; {2944#true} is VALID [2022-04-28 05:44:01,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L272 TraceCheckUtils]: 22: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2944#true} {2944#true} #83#return; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L272 TraceCheckUtils]: 17: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2944#true} {2944#true} #81#return; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,213 INFO L272 TraceCheckUtils]: 12: Hoare triple {2944#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {2944#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2944#true} {2944#true} #79#return; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2944#true} assume !(0 == ~cond); {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {2944#true} ~cond := #in~cond; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {2944#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2944#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {2944#true} call #t~ret6 := main(); {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2944#true} {2944#true} #103#return; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#true} assume true; {2944#true} is VALID [2022-04-28 05:44:01,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {2944#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2944#true} is VALID [2022-04-28 05:44:01,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {2944#true} call ULTIMATE.init(); {2944#true} is VALID [2022-04-28 05:44:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-28 05:44:01,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:44:01,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038919901] [2022-04-28 05:44:01,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:44:01,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527816335] [2022-04-28 05:44:01,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527816335] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 05:44:01,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:44:01,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 05:44:01,218 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:44:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403790541] [2022-04-28 05:44:01,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403790541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:44:01,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:44:01,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:44:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32998165] [2022-04-28 05:44:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:44:01,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-04-28 05:44:01,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:44:01,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 05:44:01,244 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 05:44:01,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:44:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:44:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:44:01,245 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 05:44:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:01,425 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2022-04-28 05:44:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 05:44:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 67 [2022-04-28 05:44:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 05:44:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 05:44:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 05:44:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-28 05:44:01,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-28 05:44:01,460 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 05:44:01,461 INFO L225 Difference]: With dead ends: 69 [2022-04-28 05:44:01,461 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 05:44:01,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 05:44:01,463 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:01,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 137 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:44:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 05:44:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2022-04-28 05:44:01,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:01,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:44:01,497 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:44:01,497 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:44:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:01,499 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-28 05:44:01,499 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 05:44:01,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:01,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:01,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 05:44:01,501 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-28 05:44:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:01,502 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2022-04-28 05:44:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2022-04-28 05:44:01,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:01,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:01,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:01,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 05:44:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-04-28 05:44:01,505 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 67 [2022-04-28 05:44:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:01,506 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-04-28 05:44:01,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-28 05:44:01,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 71 transitions. [2022-04-28 05:44:01,588 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 05:44:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-04-28 05:44:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 05:44:01,599 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:01,599 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:44:01,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 05:44:01,815 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 05:44:01,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 1 times [2022-04-28 05:44:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:01,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [388458223] [2022-04-28 05:44:01,817 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1682830289, now seen corresponding path program 2 times [2022-04-28 05:44:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:01,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697384330] [2022-04-28 05:44:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:01,839 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:01,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519243717] [2022-04-28 05:44:01,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:44:01,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:01,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:01,849 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 05:44:01,849 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 05:44:01,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:44:01,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:01,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 05:44:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:01,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:44:02,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #103#return; {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret6 := main(); {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3744#true} {3744#true} #79#return; {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L272 TraceCheckUtils]: 12: Hoare triple {3744#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3744#true} {3744#true} #81#return; {3744#true} is VALID [2022-04-28 05:44:02,095 INFO L272 TraceCheckUtils]: 17: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {3803#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:44:02,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {3803#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:02,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:02,097 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} {3744#true} #83#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 05:44:02,097 INFO L272 TraceCheckUtils]: 22: Hoare triple {3814#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,098 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3744#true} {3814#(<= 1 main_~x~0)} #85#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 05:44:02,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,098 INFO L272 TraceCheckUtils]: 28: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,099 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #87#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,099 INFO L272 TraceCheckUtils]: 33: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,099 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #89#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {3833#(<= 1 main_~a~0)} assume !false; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {3833#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {3870#(<= 1 main_~c~0)} assume !false; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,100 INFO L272 TraceCheckUtils]: 41: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,101 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #91#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,101 INFO L272 TraceCheckUtils]: 46: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,101 INFO L290 TraceCheckUtils]: 47: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,101 INFO L290 TraceCheckUtils]: 49: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,102 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #93#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,102 INFO L272 TraceCheckUtils]: 51: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,102 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #95#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,102 INFO L272 TraceCheckUtils]: 56: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,103 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #97#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,104 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 05:44:02,104 INFO L290 TraceCheckUtils]: 63: Hoare triple {3940#(<= 1 main_~b~0)} assume !false; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 05:44:02,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {3940#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3745#false} is VALID [2022-04-28 05:44:02,105 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 05:44:02,105 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 05:44:02,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 05:44:02,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 05:44:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 05:44:02,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:44:02,318 INFO L290 TraceCheckUtils]: 68: Hoare triple {3745#false} assume !false; {3745#false} is VALID [2022-04-28 05:44:02,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {3745#false} assume 0 == ~cond; {3745#false} is VALID [2022-04-28 05:44:02,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {3745#false} ~cond := #in~cond; {3745#false} is VALID [2022-04-28 05:44:02,319 INFO L272 TraceCheckUtils]: 65: Hoare triple {3745#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {3745#false} is VALID [2022-04-28 05:44:02,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {3940#(<= 1 main_~b~0)} assume !(0 != ~b~0); {3745#false} is VALID [2022-04-28 05:44:02,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {3940#(<= 1 main_~b~0)} assume !false; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 05:44:02,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {3870#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {3940#(<= 1 main_~b~0)} is VALID [2022-04-28 05:44:02,320 INFO L290 TraceCheckUtils]: 61: Hoare triple {3870#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,320 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #97#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,320 INFO L290 TraceCheckUtils]: 58: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,320 INFO L272 TraceCheckUtils]: 56: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,321 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #95#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,321 INFO L290 TraceCheckUtils]: 54: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,321 INFO L290 TraceCheckUtils]: 53: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,321 INFO L290 TraceCheckUtils]: 52: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,321 INFO L272 TraceCheckUtils]: 51: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,321 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #93#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,322 INFO L272 TraceCheckUtils]: 46: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,323 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3744#true} {3870#(<= 1 main_~c~0)} #91#return; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,323 INFO L272 TraceCheckUtils]: 41: Hoare triple {3870#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {3870#(<= 1 main_~c~0)} assume !false; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {3833#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3870#(<= 1 main_~c~0)} is VALID [2022-04-28 05:44:02,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {3833#(<= 1 main_~a~0)} assume !false; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,324 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #89#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,324 INFO L290 TraceCheckUtils]: 36: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,324 INFO L272 TraceCheckUtils]: 33: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,338 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3744#true} {3833#(<= 1 main_~a~0)} #87#return; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,338 INFO L272 TraceCheckUtils]: 28: Hoare triple {3833#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {3833#(<= 1 main_~a~0)} is VALID [2022-04-28 05:44:02,339 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3744#true} {3814#(<= 1 main_~x~0)} #85#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 05:44:02,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,339 INFO L272 TraceCheckUtils]: 22: Hoare triple {3814#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,340 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} {3744#true} #83#return; {3814#(<= 1 main_~x~0)} is VALID [2022-04-28 05:44:02,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:02,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {4109#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3807#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:02,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {3744#true} ~cond := #in~cond; {4109#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 05:44:02,341 INFO L272 TraceCheckUtils]: 17: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3744#true} {3744#true} #81#return; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L272 TraceCheckUtils]: 12: Hoare triple {3744#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {3744#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3744#true} {3744#true} #79#return; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {3744#true} assume !(0 == ~cond); {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {3744#true} ~cond := #in~cond; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {3744#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {3744#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {3744#true} is VALID [2022-04-28 05:44:02,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {3744#true} call #t~ret6 := main(); {3744#true} is VALID [2022-04-28 05:44:02,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3744#true} {3744#true} #103#return; {3744#true} is VALID [2022-04-28 05:44:02,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {3744#true} assume true; {3744#true} is VALID [2022-04-28 05:44:02,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {3744#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3744#true} is VALID [2022-04-28 05:44:02,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {3744#true} call ULTIMATE.init(); {3744#true} is VALID [2022-04-28 05:44:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 05:44:02,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:44:02,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697384330] [2022-04-28 05:44:02,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:44:02,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519243717] [2022-04-28 05:44:02,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519243717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:44:02,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:44:02,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:44:02,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:44:02,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [388458223] [2022-04-28 05:44:02,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [388458223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:44:02,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:44:02,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:44:02,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545876384] [2022-04-28 05:44:02,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:44:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2022-04-28 05:44:02,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:44:02,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:44:02,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:02,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:44:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:44:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:44:02,363 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:44:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:02,925 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-28 05:44:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:44:02,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 69 [2022-04-28 05:44:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:44:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-28 05:44:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:44:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2022-04-28 05:44:02,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 110 transitions. [2022-04-28 05:44:03,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:03,017 INFO L225 Difference]: With dead ends: 106 [2022-04-28 05:44:03,017 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 05:44:03,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:44:03,017 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:03,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 259 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 05:44:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 05:44:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-28 05:44:03,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:03,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 05:44:03,128 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 05:44:03,134 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 05:44:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:03,138 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-28 05:44:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-28 05:44:03,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:03,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:03,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-28 05:44:03,141 INFO L87 Difference]: Start difference. First operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand 98 states. [2022-04-28 05:44:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:03,144 INFO L93 Difference]: Finished difference Result 98 states and 137 transitions. [2022-04-28 05:44:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2022-04-28 05:44:03,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:03,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:03,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:03,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 34 states have call successors, (34), 8 states have call predecessors, (34), 7 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-28 05:44:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2022-04-28 05:44:03,147 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 69 [2022-04-28 05:44:03,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:03,147 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2022-04-28 05:44:03,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-28 05:44:03,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 122 transitions. [2022-04-28 05:44:03,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2022-04-28 05:44:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 05:44:03,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:03,307 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:44:03,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 05:44:03,507 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 05:44:03,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 1 times [2022-04-28 05:44:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:03,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [462865883] [2022-04-28 05:44:03,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 376741854, now seen corresponding path program 2 times [2022-04-28 05:44:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:03,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120661214] [2022-04-28 05:44:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:03,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:03,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [770949789] [2022-04-28 05:44:03,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:44:03,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:03,526 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 05:44:03,528 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 05:44:03,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:44:03,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:03,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 05:44:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:03,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:44:03,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {4762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4762#true} #103#return; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {4762#true} call #t~ret6 := main(); {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {4762#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4762#true} {4762#true} #79#return; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L272 TraceCheckUtils]: 12: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4762#true} #81#return; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L272 TraceCheckUtils]: 17: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4762#true} #83#return; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L272 TraceCheckUtils]: 22: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,847 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4762#true} {4762#true} #85#return; {4762#true} is VALID [2022-04-28 05:44:03,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:44:03,848 INFO L272 TraceCheckUtils]: 28: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,849 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4762#true} {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #87#return; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:44:03,849 INFO L272 TraceCheckUtils]: 33: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,850 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4762#true} {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #89#return; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:44:03,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:44:03,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {4848#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4885#(= main_~q~0 0)} is VALID [2022-04-28 05:44:03,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {4885#(= main_~q~0 0)} assume !false; {4885#(= main_~q~0 0)} is VALID [2022-04-28 05:44:03,851 INFO L272 TraceCheckUtils]: 41: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,851 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4762#true} {4885#(= main_~q~0 0)} #91#return; {4885#(= main_~q~0 0)} is VALID [2022-04-28 05:44:03,852 INFO L272 TraceCheckUtils]: 46: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,852 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4762#true} {4885#(= main_~q~0 0)} #93#return; {4885#(= main_~q~0 0)} is VALID [2022-04-28 05:44:03,853 INFO L272 TraceCheckUtils]: 51: Hoare triple {4885#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {4762#true} ~cond := #in~cond; {4925#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:03,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {4925#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:03,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:03,854 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} {4885#(= main_~q~0 0)} #95#return; {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 05:44:03,854 INFO L272 TraceCheckUtils]: 56: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,855 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4762#true} {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #97#return; {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 05:44:03,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-28 05:44:03,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {4936#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:44:03,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:44:03,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:44:03,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:44:03,857 INFO L272 TraceCheckUtils]: 66: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:03,857 INFO L290 TraceCheckUtils]: 67: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:03,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:03,858 INFO L290 TraceCheckUtils]: 69: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:03,858 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4762#true} {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:44:03,859 INFO L272 TraceCheckUtils]: 71: Hoare triple {4958#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:03,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:03,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {4990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2022-04-28 05:44:03,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2022-04-28 05:44:03,860 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:44:03,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:44:12,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {4763#false} assume !false; {4763#false} is VALID [2022-04-28 05:44:12,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {4990#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4763#false} is VALID [2022-04-28 05:44:12,966 INFO L290 TraceCheckUtils]: 72: Hoare triple {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4990#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:12,967 INFO L272 TraceCheckUtils]: 71: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4986#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:12,968 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {4762#true} {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:12,968 INFO L290 TraceCheckUtils]: 69: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,968 INFO L290 TraceCheckUtils]: 68: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,968 INFO L290 TraceCheckUtils]: 67: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,968 INFO L272 TraceCheckUtils]: 66: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,970 INFO L290 TraceCheckUtils]: 65: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:12,971 INFO L290 TraceCheckUtils]: 64: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:12,971 INFO L290 TraceCheckUtils]: 63: Hoare triple {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:12,972 INFO L290 TraceCheckUtils]: 62: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5006#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:44:12,972 INFO L290 TraceCheckUtils]: 61: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:44:12,973 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4762#true} {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:44:12,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,973 INFO L290 TraceCheckUtils]: 58: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,973 INFO L272 TraceCheckUtils]: 56: Hoare triple {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,974 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} {4762#true} #95#return; {5034#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:44:12,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:12,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {5065#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4929#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:12,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {4762#true} ~cond := #in~cond; {5065#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:44:12,975 INFO L272 TraceCheckUtils]: 51: Hoare triple {4762#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4762#true} {4762#true} #93#return; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 47: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L272 TraceCheckUtils]: 46: Hoare triple {4762#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4762#true} {4762#true} #91#return; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L272 TraceCheckUtils]: 41: Hoare triple {4762#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {4762#true} assume !false; {4762#true} is VALID [2022-04-28 05:44:12,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {4762#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {4762#true} assume !false; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4762#true} {4762#true} #89#return; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L272 TraceCheckUtils]: 33: Hoare triple {4762#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4762#true} {4762#true} #87#return; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L272 TraceCheckUtils]: 28: Hoare triple {4762#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {4762#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4762#true} {4762#true} #85#return; {4762#true} is VALID [2022-04-28 05:44:12,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L272 TraceCheckUtils]: 22: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4762#true} {4762#true} #83#return; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L272 TraceCheckUtils]: 17: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4762#true} {4762#true} #81#return; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {4762#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {4762#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4762#true} {4762#true} #79#return; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {4762#true} assume !(0 == ~cond); {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {4762#true} ~cond := #in~cond; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {4762#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {4762#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {4762#true} call #t~ret6 := main(); {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4762#true} {4762#true} #103#return; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {4762#true} assume true; {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {4762#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {4762#true} call ULTIMATE.init(); {4762#true} is VALID [2022-04-28 05:44:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 05:44:12,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:44:12,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120661214] [2022-04-28 05:44:12,979 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:44:12,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770949789] [2022-04-28 05:44:12,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770949789] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:44:12,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:44:12,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-28 05:44:12,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:44:12,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [462865883] [2022-04-28 05:44:12,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [462865883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:44:12,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:44:12,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:44:12,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934564446] [2022-04-28 05:44:12,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:44:12,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2022-04-28 05:44:12,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:44:12,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:44:13,016 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 05:44:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:44:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:13,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:44:13,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-28 05:44:13,017 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:44:13,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:13,756 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2022-04-28 05:44:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:44:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 75 [2022-04-28 05:44:13,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:44:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-28 05:44:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:44:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-28 05:44:13,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-28 05:44:13,842 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 05:44:13,844 INFO L225 Difference]: With dead ends: 124 [2022-04-28 05:44:13,844 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 05:44:13,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-04-28 05:44:13,846 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:13,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 218 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:44:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 05:44:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2022-04-28 05:44:13,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:13,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:13,976 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:13,976 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:13,985 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2022-04-28 05:44:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2022-04-28 05:44:13,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:13,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:13,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 121 states. [2022-04-28 05:44:13,986 INFO L87 Difference]: Start difference. First operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 121 states. [2022-04-28 05:44:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:13,989 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2022-04-28 05:44:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2022-04-28 05:44:13,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:13,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:13,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:13,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 47 states have call successors, (47), 9 states have call predecessors, (47), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2022-04-28 05:44:13,992 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 75 [2022-04-28 05:44:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:13,992 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2022-04-28 05:44:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-28 05:44:13,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 166 transitions. [2022-04-28 05:44:14,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2022-04-28 05:44:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 05:44:14,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:14,188 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:44:14,205 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 05:44:14,404 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 05:44:14,404 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 3 times [2022-04-28 05:44:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:14,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1663061207] [2022-04-28 05:44:14,405 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1245952186, now seen corresponding path program 4 times [2022-04-28 05:44:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:14,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226900863] [2022-04-28 05:44:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:14,415 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:14,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854589428] [2022-04-28 05:44:14,415 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:44:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:14,416 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 05:44:14,417 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 05:44:14,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:44:14,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:14,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 05:44:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:14,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:44:15,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2022-04-28 05:44:15,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #103#return; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret6 := main(); {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5956#true} {5956#true} #79#return; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5956#true} is VALID [2022-04-28 05:44:15,467 INFO L272 TraceCheckUtils]: 12: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#true} ~cond := #in~cond; {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:44:15,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:15,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:15,468 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} {5956#true} #81#return; {6011#(and (<= 0 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,468 INFO L272 TraceCheckUtils]: 17: Hoare triple {6011#(and (<= 0 main_~y~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#true} ~cond := #in~cond; {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:44:15,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {6000#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:15,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6004#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:44:15,469 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6004#(not (= |assume_abort_if_not_#in~cond| 0))} {6011#(and (<= 0 main_~y~0) (<= main_~y~0 5))} #83#return; {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,469 INFO L272 TraceCheckUtils]: 22: Hoare triple {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,470 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5956#true} {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} #85#return; {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {6027#(and (<= 0 main_~y~0) (<= 1 main_~x~0) (<= main_~y~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,470 INFO L272 TraceCheckUtils]: 28: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,471 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5956#true} {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} #87#return; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,471 INFO L272 TraceCheckUtils]: 33: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,472 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5956#true} {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} #89#return; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !false; {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {6046#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,473 INFO L272 TraceCheckUtils]: 41: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,473 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5956#true} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,474 INFO L272 TraceCheckUtils]: 46: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,474 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5956#true} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,474 INFO L272 TraceCheckUtils]: 51: Hoare triple {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#true} ~cond := #in~cond; {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:15,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:15,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:15,476 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6083#(and (<= 0 main_~y~0) (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (<= main_~b~0 main_~y~0) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,476 INFO L272 TraceCheckUtils]: 56: Hoare triple {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,476 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5956#true} {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {6134#(and (<= 0 main_~y~0) (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {6153#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:44:15,477 INFO L290 TraceCheckUtils]: 62: Hoare triple {6153#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (< main_~c~0 main_~b~0) (<= main_~y~0 5) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,478 INFO L290 TraceCheckUtils]: 63: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} assume !false; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,478 INFO L290 TraceCheckUtils]: 64: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,478 INFO L290 TraceCheckUtils]: 65: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} assume !false; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,478 INFO L272 TraceCheckUtils]: 66: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:15,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:15,479 INFO L290 TraceCheckUtils]: 69: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:15,483 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5956#true} {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} #91#return; {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,483 INFO L272 TraceCheckUtils]: 71: Hoare triple {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:15,484 INFO L290 TraceCheckUtils]: 72: Hoare triple {5956#true} ~cond := #in~cond; {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:15,484 INFO L290 TraceCheckUtils]: 73: Hoare triple {6123#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:15,484 INFO L290 TraceCheckUtils]: 74: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:15,485 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6157#(and (= (+ main_~y~0 (* main_~p~0 main_~x~0)) main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (< main_~x~0 main_~a~0) (= main_~q~0 1) (<= main_~y~0 5))} #93#return; {6197#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 5))} is VALID [2022-04-28 05:44:15,485 INFO L272 TraceCheckUtils]: 76: Hoare triple {6197#(and (= main_~s~0 0) (<= 1 main_~x~0) (< main_~x~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= main_~y~0 5))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:15,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:15,486 INFO L290 TraceCheckUtils]: 78: Hoare triple {6205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5957#false} is VALID [2022-04-28 05:44:15,486 INFO L290 TraceCheckUtils]: 79: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2022-04-28 05:44:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 34 proven. 32 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 05:44:15,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:44:56,184 INFO L290 TraceCheckUtils]: 79: Hoare triple {5957#false} assume !false; {5957#false} is VALID [2022-04-28 05:44:56,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {6205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5957#false} is VALID [2022-04-28 05:44:56,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:44:56,185 INFO L272 TraceCheckUtils]: 76: Hoare triple {6221#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:44:56,186 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #93#return; {6221#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:44:56,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:56,186 INFO L290 TraceCheckUtils]: 73: Hoare triple {6235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6127#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:44:56,187 INFO L290 TraceCheckUtils]: 72: Hoare triple {5956#true} ~cond := #in~cond; {6235#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:44:56,187 INFO L272 TraceCheckUtils]: 71: Hoare triple {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,187 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {5956#true} {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #91#return; {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:44:56,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,188 INFO L272 TraceCheckUtils]: 66: Hoare triple {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:44:56,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6225#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:44:56,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !false; {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:44:56,269 INFO L290 TraceCheckUtils]: 62: Hoare triple {6267#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~c~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {6260#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:44:56,270 INFO L290 TraceCheckUtils]: 61: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !(~c~0 >= ~b~0); {6267#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,271 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #97#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,271 INFO L290 TraceCheckUtils]: 57: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,271 INFO L272 TraceCheckUtils]: 56: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,272 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #95#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,272 INFO L290 TraceCheckUtils]: 53: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,272 INFO L272 TraceCheckUtils]: 51: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,273 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #93#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,273 INFO L272 TraceCheckUtils]: 46: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,274 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5956#true} {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} #91#return; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,274 INFO L290 TraceCheckUtils]: 44: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,274 INFO L290 TraceCheckUtils]: 43: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,274 INFO L272 TraceCheckUtils]: 41: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} assume !false; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,275 INFO L290 TraceCheckUtils]: 39: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {6271#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (= main_~c~0 0))} is VALID [2022-04-28 05:44:56,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} assume !false; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 05:44:56,276 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5956#true} {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} #89#return; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 05:44:56,276 INFO L290 TraceCheckUtils]: 36: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,276 INFO L272 TraceCheckUtils]: 33: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,277 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5956#true} {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} #87#return; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 05:44:56,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,277 INFO L272 TraceCheckUtils]: 28: Hoare triple {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {5956#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {6338#(or (= main_~a~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~a~0))} is VALID [2022-04-28 05:44:56,278 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5956#true} {5956#true} #85#return; {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L272 TraceCheckUtils]: 22: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5956#true} {5956#true} #83#return; {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L272 TraceCheckUtils]: 17: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,278 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5956#true} {5956#true} #81#return; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L272 TraceCheckUtils]: 12: Hoare triple {5956#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {5956#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5956#true} {5956#true} #79#return; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {5956#true} assume !(0 == ~cond); {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {5956#true} ~cond := #in~cond; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L272 TraceCheckUtils]: 6: Hoare triple {5956#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {5956#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {5956#true} call #t~ret6 := main(); {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5956#true} {5956#true} #103#return; {5956#true} is VALID [2022-04-28 05:44:56,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {5956#true} assume true; {5956#true} is VALID [2022-04-28 05:44:56,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {5956#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5956#true} is VALID [2022-04-28 05:44:56,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {5956#true} call ULTIMATE.init(); {5956#true} is VALID [2022-04-28 05:44:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 05:44:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:44:56,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226900863] [2022-04-28 05:44:56,280 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:44:56,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854589428] [2022-04-28 05:44:56,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854589428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:44:56,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:44:56,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 23 [2022-04-28 05:44:56,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:44:56,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1663061207] [2022-04-28 05:44:56,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1663061207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:44:56,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:44:56,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 05:44:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977962266] [2022-04-28 05:44:56,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:44:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2022-04-28 05:44:56,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:44:56,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 05:44:56,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:56,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 05:44:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:56,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 05:44:56,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-28 05:44:56,340 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 05:44:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:57,760 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2022-04-28 05:44:57,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 05:44:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) Word has length 80 [2022-04-28 05:44:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:44:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 05:44:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-28 05:44:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 05:44:57,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 91 transitions. [2022-04-28 05:44:57,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 91 transitions. [2022-04-28 05:44:57,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:57,828 INFO L225 Difference]: With dead ends: 134 [2022-04-28 05:44:57,828 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 05:44:57,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2022-04-28 05:44:57,829 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 05:44:57,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 157 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 05:44:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 05:44:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-04-28 05:44:58,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:44:58,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:58,024 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:58,025 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:58,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:58,028 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2022-04-28 05:44:58,028 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-28 05:44:58,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:58,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:58,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 132 states. [2022-04-28 05:44:58,029 INFO L87 Difference]: Start difference. First operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 132 states. [2022-04-28 05:44:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:44:58,033 INFO L93 Difference]: Finished difference Result 132 states and 177 transitions. [2022-04-28 05:44:58,033 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 177 transitions. [2022-04-28 05:44:58,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:44:58,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:44:58,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:44:58,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:44:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 47 states have call successors, (47), 12 states have call predecessors, (47), 11 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:44:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 175 transitions. [2022-04-28 05:44:58,037 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 175 transitions. Word has length 80 [2022-04-28 05:44:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:44:58,037 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 175 transitions. [2022-04-28 05:44:58,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2022-04-28 05:44:58,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 175 transitions. [2022-04-28 05:44:58,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:44:58,261 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 175 transitions. [2022-04-28 05:44:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 05:44:58,268 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:44:58,268 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 2, 2, 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, 1, 1, 1, 1, 1] [2022-04-28 05:44:58,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-28 05:44:58,484 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 05:44:58,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:44:58,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:44:58,485 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 5 times [2022-04-28 05:44:58,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:44:58,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1580263155] [2022-04-28 05:44:58,486 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:44:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 901388446, now seen corresponding path program 6 times [2022-04-28 05:44:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:44:58,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94569597] [2022-04-28 05:44:58,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:44:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:44:58,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:44:58,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646546062] [2022-04-28 05:44:58,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:44:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:44:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:44:58,497 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 05:44:58,498 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 05:44:58,549 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:44:58,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:44:58,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 05:44:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:44:58,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:45:00,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {7262#true} call ULTIMATE.init(); {7262#true} is VALID [2022-04-28 05:45:00,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {7262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7262#true} {7262#true} #103#return; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {7262#true} call #t~ret6 := main(); {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {7262#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {7262#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7262#true} {7262#true} #79#return; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {7262#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L272 TraceCheckUtils]: 12: Hoare triple {7262#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7262#true} {7262#true} #81#return; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L272 TraceCheckUtils]: 17: Hoare triple {7262#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7262#true} {7262#true} #83#return; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L272 TraceCheckUtils]: 22: Hoare triple {7262#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,257 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7262#true} {7262#true} #85#return; {7262#true} is VALID [2022-04-28 05:45:00,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {7262#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:45:00,258 INFO L272 TraceCheckUtils]: 28: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7262#true} {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #87#return; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:45:00,259 INFO L272 TraceCheckUtils]: 33: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,259 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7262#true} {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #89#return; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:45:00,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !false; {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:45:00,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {7348#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !false; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,261 INFO L272 TraceCheckUtils]: 41: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,261 INFO L290 TraceCheckUtils]: 42: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,261 INFO L290 TraceCheckUtils]: 43: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,261 INFO L290 TraceCheckUtils]: 44: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,262 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #91#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,262 INFO L272 TraceCheckUtils]: 46: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,263 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #93#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,263 INFO L272 TraceCheckUtils]: 51: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,264 INFO L290 TraceCheckUtils]: 54: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,264 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #95#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,264 INFO L272 TraceCheckUtils]: 56: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,267 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7262#true} {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} #97#return; {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:45:00,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {7385#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,269 INFO L290 TraceCheckUtils]: 65: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,269 INFO L272 TraceCheckUtils]: 66: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,269 INFO L290 TraceCheckUtils]: 69: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,270 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {7262#true} {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,270 INFO L272 TraceCheckUtils]: 71: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,270 INFO L290 TraceCheckUtils]: 72: Hoare triple {7262#true} ~cond := #in~cond; {7262#true} is VALID [2022-04-28 05:45:00,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {7262#true} assume !(0 == ~cond); {7262#true} is VALID [2022-04-28 05:45:00,273 INFO L290 TraceCheckUtils]: 74: Hoare triple {7262#true} assume true; {7262#true} is VALID [2022-04-28 05:45:00,273 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7262#true} {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,273 INFO L272 TraceCheckUtils]: 76: Hoare triple {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7262#true} is VALID [2022-04-28 05:45:00,274 INFO L290 TraceCheckUtils]: 77: Hoare triple {7262#true} ~cond := #in~cond; {7501#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:00,274 INFO L290 TraceCheckUtils]: 78: Hoare triple {7501#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:00,274 INFO L290 TraceCheckUtils]: 79: Hoare triple {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:00,275 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7505#(not (= |__VERIFIER_assert_#in~cond| 0))} {7455#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {7512#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:45:00,277 INFO L272 TraceCheckUtils]: 81: Hoare triple {7512#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~b~0 main_~x~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {7516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:45:00,277 INFO L290 TraceCheckUtils]: 82: Hoare triple {7516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:00,278 INFO L290 TraceCheckUtils]: 83: Hoare triple {7520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7263#false} is VALID [2022-04-28 05:45:00,278 INFO L290 TraceCheckUtils]: 84: Hoare triple {7263#false} assume !false; {7263#false} is VALID [2022-04-28 05:45:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-28 05:45:00,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:45:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:45:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94569597] [2022-04-28 05:45:41,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:45:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646546062] [2022-04-28 05:45:41,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646546062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:45:41,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:45:41,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-28 05:45:41,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:45:41,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1580263155] [2022-04-28 05:45:41,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1580263155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:45:41,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:45:41,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 05:45:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685282100] [2022-04-28 05:45:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:45:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2022-04-28 05:45:41,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:45:41,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 05:45:41,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:41,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 05:45:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:45:41,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 05:45:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:45:41,823 INFO L87 Difference]: Start difference. First operand 130 states and 175 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 05:45:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:42,980 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2022-04-28 05:45:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 05:45:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 85 [2022-04-28 05:45:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:45:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 05:45:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-28 05:45:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 05:45:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-28 05:45:42,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 98 transitions. [2022-04-28 05:45:43,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:43,072 INFO L225 Difference]: With dead ends: 142 [2022-04-28 05:45:43,072 INFO L226 Difference]: Without dead ends: 140 [2022-04-28 05:45:43,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:45:43,073 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 05:45:43,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 222 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 05:45:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-28 05:45:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-04-28 05:45:43,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:45:43,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:45:43,332 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:45:43,333 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:45:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:43,337 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2022-04-28 05:45:43,337 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2022-04-28 05:45:43,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:45:43,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:45:43,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 140 states. [2022-04-28 05:45:43,338 INFO L87 Difference]: Start difference. First operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand 140 states. [2022-04-28 05:45:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:43,343 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2022-04-28 05:45:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2022-04-28 05:45:43,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:45:43,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:45:43,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:45:43,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:45:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 79 states have internal predecessors, (90), 47 states have call successors, (47), 14 states have call predecessors, (47), 13 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-28 05:45:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2022-04-28 05:45:43,347 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 85 [2022-04-28 05:45:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:45:43,347 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2022-04-28 05:45:43,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-04-28 05:45:43,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 181 transitions. [2022-04-28 05:45:43,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2022-04-28 05:45:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 05:45:43,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:45:43,608 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 6, 6, 6, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:45:43,657 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 05:45:43,808 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 05:45:43,808 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:45:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:45:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 1 times [2022-04-28 05:45:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:45:43,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334028619] [2022-04-28 05:45:43,809 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:45:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash -686534738, now seen corresponding path program 2 times [2022-04-28 05:45:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:45:43,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228301033] [2022-04-28 05:45:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:45:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:45:43,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:45:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715957213] [2022-04-28 05:45:43,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:45:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:45:43,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:45:43,824 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 05:45:43,825 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 05:45:43,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:45:43,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:45:43,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 05:45:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:45:43,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:45:44,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {8389#true} call ULTIMATE.init(); {8389#true} is VALID [2022-04-28 05:45:44,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {8389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8389#true} is VALID [2022-04-28 05:45:44,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8389#true} {8389#true} #103#return; {8389#true} is VALID [2022-04-28 05:45:44,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {8389#true} call #t~ret6 := main(); {8389#true} is VALID [2022-04-28 05:45:44,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {8389#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8389#true} is VALID [2022-04-28 05:45:44,573 INFO L272 TraceCheckUtils]: 6: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8389#true} {8389#true} #79#return; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {8389#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L272 TraceCheckUtils]: 12: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8389#true} {8389#true} #81#return; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L272 TraceCheckUtils]: 17: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8389#true} {8389#true} #83#return; {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L272 TraceCheckUtils]: 22: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,575 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8389#true} {8389#true} #85#return; {8389#true} is VALID [2022-04-28 05:45:44,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {8389#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,575 INFO L272 TraceCheckUtils]: 28: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,576 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8389#true} {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,576 INFO L272 TraceCheckUtils]: 33: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,577 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8389#true} {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {8475#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,579 INFO L272 TraceCheckUtils]: 41: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,580 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,580 INFO L272 TraceCheckUtils]: 46: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,581 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,581 INFO L272 TraceCheckUtils]: 51: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,582 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,582 INFO L272 TraceCheckUtils]: 56: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,582 INFO L290 TraceCheckUtils]: 57: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,582 INFO L290 TraceCheckUtils]: 58: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,583 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8389#true} {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {8512#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !false; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,584 INFO L272 TraceCheckUtils]: 63: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,585 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #91#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,585 INFO L272 TraceCheckUtils]: 68: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,586 INFO L290 TraceCheckUtils]: 71: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,587 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #93#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,587 INFO L272 TraceCheckUtils]: 73: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,587 INFO L290 TraceCheckUtils]: 74: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,588 INFO L290 TraceCheckUtils]: 75: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,588 INFO L290 TraceCheckUtils]: 76: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,589 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,589 INFO L272 TraceCheckUtils]: 78: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:44,589 INFO L290 TraceCheckUtils]: 79: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:44,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:44,590 INFO L290 TraceCheckUtils]: 81: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:44,590 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8389#true} {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,601 INFO L290 TraceCheckUtils]: 83: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:44,601 INFO L290 TraceCheckUtils]: 84: Hoare triple {8579#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:45:44,602 INFO L290 TraceCheckUtils]: 85: Hoare triple {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !false; {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:45:44,602 INFO L290 TraceCheckUtils]: 86: Hoare triple {8649#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {8656#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-28 05:45:44,603 INFO L272 TraceCheckUtils]: 87: Hoare triple {8656#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:45:44,603 INFO L290 TraceCheckUtils]: 88: Hoare triple {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:44,604 INFO L290 TraceCheckUtils]: 89: Hoare triple {8664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8390#false} is VALID [2022-04-28 05:45:44,604 INFO L290 TraceCheckUtils]: 90: Hoare triple {8390#false} assume !false; {8390#false} is VALID [2022-04-28 05:45:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 05:45:44,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:45:45,000 INFO L290 TraceCheckUtils]: 90: Hoare triple {8390#false} assume !false; {8390#false} is VALID [2022-04-28 05:45:45,001 INFO L290 TraceCheckUtils]: 89: Hoare triple {8664#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8390#false} is VALID [2022-04-28 05:45:45,001 INFO L290 TraceCheckUtils]: 88: Hoare triple {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8664#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:45,001 INFO L272 TraceCheckUtils]: 87: Hoare triple {8680#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8660#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:45:45,002 INFO L290 TraceCheckUtils]: 86: Hoare triple {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {8680#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 05:45:45,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:45:47,003 WARN L290 TraceCheckUtils]: 84: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {8684#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-28 05:45:47,004 INFO L290 TraceCheckUtils]: 83: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,005 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #97#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,005 INFO L290 TraceCheckUtils]: 81: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,005 INFO L290 TraceCheckUtils]: 80: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,005 INFO L290 TraceCheckUtils]: 79: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,005 INFO L272 TraceCheckUtils]: 78: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,005 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #95#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,006 INFO L290 TraceCheckUtils]: 76: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,006 INFO L290 TraceCheckUtils]: 74: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,006 INFO L272 TraceCheckUtils]: 73: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,006 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #93#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,006 INFO L290 TraceCheckUtils]: 71: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,007 INFO L272 TraceCheckUtils]: 68: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,007 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8389#true} {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #91#return; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,007 INFO L290 TraceCheckUtils]: 65: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,007 INFO L290 TraceCheckUtils]: 64: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,007 INFO L272 TraceCheckUtils]: 63: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !false; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {8691#(or (not (= main_~c~0 0)) (= (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-28 05:45:47,292 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #97#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,292 INFO L290 TraceCheckUtils]: 59: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,292 INFO L290 TraceCheckUtils]: 57: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,292 INFO L272 TraceCheckUtils]: 56: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,293 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #95#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,293 INFO L272 TraceCheckUtils]: 51: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,293 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #93#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,294 INFO L272 TraceCheckUtils]: 46: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,294 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8389#true} {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} #91#return; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,294 INFO L290 TraceCheckUtils]: 43: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,294 INFO L290 TraceCheckUtils]: 42: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,294 INFO L272 TraceCheckUtils]: 41: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} assume !false; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8761#(or (= (+ (* (+ main_~k~0 1) main_~q~0 main_~x~0) (* (+ main_~k~0 1) main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !false; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,296 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8389#true} {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #89#return; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,296 INFO L290 TraceCheckUtils]: 35: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,296 INFO L272 TraceCheckUtils]: 33: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,296 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {8389#true} {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #87#return; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L272 TraceCheckUtils]: 28: Hoare triple {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {8389#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {8828#(or (= (+ (* main_~q~0 main_~x~0 1) (* main_~y~0 main_~s~0 1)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-28 05:45:47,297 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8389#true} {8389#true} #85#return; {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,298 INFO L272 TraceCheckUtils]: 22: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,298 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8389#true} {8389#true} #83#return; {8389#true} is VALID [2022-04-28 05:45:47,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L272 TraceCheckUtils]: 17: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8389#true} {8389#true} #81#return; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {8389#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {8389#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8389#true} {8389#true} #79#return; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {8389#true} assume !(0 == ~cond); {8389#true} is VALID [2022-04-28 05:45:47,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {8389#true} ~cond := #in~cond; {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {8389#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {8389#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {8389#true} call #t~ret6 := main(); {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8389#true} {8389#true} #103#return; {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {8389#true} assume true; {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {8389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8389#true} is VALID [2022-04-28 05:45:47,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {8389#true} call ULTIMATE.init(); {8389#true} is VALID [2022-04-28 05:45:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-04-28 05:45:47,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:45:47,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228301033] [2022-04-28 05:45:47,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:45:47,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715957213] [2022-04-28 05:45:47,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715957213] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:45:47,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:45:47,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-28 05:45:47,307 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:45:47,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334028619] [2022-04-28 05:45:47,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334028619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:45:47,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:45:47,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 05:45:47,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654407699] [2022-04-28 05:45:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:45:47,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 91 [2022-04-28 05:45:47,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:45:47,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 05:45:47,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:47,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 05:45:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:45:47,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 05:45:47,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-28 05:45:47,340 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 05:45:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:48,358 INFO L93 Difference]: Finished difference Result 165 states and 217 transitions. [2022-04-28 05:45:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 05:45:48,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 91 [2022-04-28 05:45:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:45:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 05:45:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 05:45:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 05:45:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-28 05:45:48,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-28 05:45:48,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:48,473 INFO L225 Difference]: With dead ends: 165 [2022-04-28 05:45:48,473 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 05:45:48,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:45:48,474 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:45:48,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 275 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:45:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 05:45:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2022-04-28 05:45:48,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:45:48,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:48,818 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:48,818 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:48,821 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2022-04-28 05:45:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2022-04-28 05:45:48,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:45:48,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:45:48,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 162 states. [2022-04-28 05:45:48,822 INFO L87 Difference]: Start difference. First operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 162 states. [2022-04-28 05:45:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:48,825 INFO L93 Difference]: Finished difference Result 162 states and 213 transitions. [2022-04-28 05:45:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2022-04-28 05:45:48,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:45:48,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:45:48,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:45:48,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:45:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 92 states have internal predecessors, (105), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2022-04-28 05:45:48,829 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 91 [2022-04-28 05:45:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:45:48,829 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2022-04-28 05:45:48,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 5 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-28 05:45:48,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 212 transitions. [2022-04-28 05:45:49,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2022-04-28 05:45:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 05:45:49,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:45:49,132 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 6, 6, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-04-28 05:45:49,151 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 05:45:49,332 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 05:45:49,332 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:45:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:45:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash -663071842, now seen corresponding path program 7 times [2022-04-28 05:45:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:45:49,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167009315] [2022-04-28 05:45:49,333 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:45:49,333 INFO L85 PathProgramCache]: Analyzing trace with hash -663071842, now seen corresponding path program 8 times [2022-04-28 05:45:49,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:45:49,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743634480] [2022-04-28 05:45:49,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:45:49,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:45:49,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:45:49,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236949982] [2022-04-28 05:45:49,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:45:49,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:45:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:45:49,353 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 05:45:49,354 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 05:45:49,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:45:49,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:45:49,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 05:45:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:45:49,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:45:49,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {9932#true} call ULTIMATE.init(); {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {9932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9932#true} {9932#true} #103#return; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {9932#true} call #t~ret6 := main(); {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {9932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L272 TraceCheckUtils]: 6: Hoare triple {9932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9932#true} {9932#true} #79#return; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {9932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {9932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {9932#true} {9932#true} #81#return; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L272 TraceCheckUtils]: 17: Hoare triple {9932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {9932#true} {9932#true} #83#return; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L272 TraceCheckUtils]: 22: Hoare triple {9932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9932#true} {9932#true} #85#return; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {9932#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {9932#true} is VALID [2022-04-28 05:45:49,661 INFO L272 TraceCheckUtils]: 28: Hoare triple {9932#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9932#true} {9932#true} #87#return; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L272 TraceCheckUtils]: 33: Hoare triple {9932#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9932#true} {9932#true} #89#return; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {9932#true} assume !false; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {9932#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {9932#true} assume !false; {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L272 TraceCheckUtils]: 41: Hoare triple {9932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9932#true} {9932#true} #91#return; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L272 TraceCheckUtils]: 46: Hoare triple {9932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9932#true} {9932#true} #93#return; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L272 TraceCheckUtils]: 51: Hoare triple {9932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 54: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9932#true} {9932#true} #95#return; {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L272 TraceCheckUtils]: 56: Hoare triple {9932#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,664 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9932#true} {9932#true} #97#return; {9932#true} is VALID [2022-04-28 05:45:49,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {9932#true} assume !(~c~0 >= ~b~0); {10120#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:45:49,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {10120#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {10124#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:45:49,665 INFO L290 TraceCheckUtils]: 63: Hoare triple {10124#(< main_~b~0 main_~a~0)} assume !false; {10124#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:45:49,665 INFO L290 TraceCheckUtils]: 64: Hoare triple {10124#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:45:49,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {10131#(< main_~b~0 main_~c~0)} assume !false; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:45:49,666 INFO L272 TraceCheckUtils]: 66: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,666 INFO L290 TraceCheckUtils]: 67: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,666 INFO L290 TraceCheckUtils]: 68: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,666 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #91#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:45:49,666 INFO L272 TraceCheckUtils]: 71: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,666 INFO L290 TraceCheckUtils]: 72: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,667 INFO L290 TraceCheckUtils]: 73: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,667 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #93#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:45:49,667 INFO L272 TraceCheckUtils]: 76: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,668 INFO L290 TraceCheckUtils]: 78: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,668 INFO L290 TraceCheckUtils]: 79: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,668 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #95#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:45:49,668 INFO L272 TraceCheckUtils]: 81: Hoare triple {10131#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {9932#true} is VALID [2022-04-28 05:45:49,668 INFO L290 TraceCheckUtils]: 82: Hoare triple {9932#true} ~cond := #in~cond; {9932#true} is VALID [2022-04-28 05:45:49,668 INFO L290 TraceCheckUtils]: 83: Hoare triple {9932#true} assume !(0 == ~cond); {9932#true} is VALID [2022-04-28 05:45:49,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {9932#true} assume true; {9932#true} is VALID [2022-04-28 05:45:49,669 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {9932#true} {10131#(< main_~b~0 main_~c~0)} #97#return; {10131#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:45:49,669 INFO L290 TraceCheckUtils]: 86: Hoare triple {10131#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 87: Hoare triple {9933#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 88: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 89: Hoare triple {9933#false} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 90: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L272 TraceCheckUtils]: 91: Hoare triple {9933#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 92: Hoare triple {9933#false} ~cond := #in~cond; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 93: Hoare triple {9933#false} assume !(0 == ~cond); {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 94: Hoare triple {9933#false} assume true; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9933#false} {9933#false} #91#return; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L272 TraceCheckUtils]: 96: Hoare triple {9933#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 97: Hoare triple {9933#false} ~cond := #in~cond; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 98: Hoare triple {9933#false} assume 0 == ~cond; {9933#false} is VALID [2022-04-28 05:45:49,670 INFO L290 TraceCheckUtils]: 99: Hoare triple {9933#false} assume !false; {9933#false} is VALID [2022-04-28 05:45:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-04-28 05:45:49,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 05:45:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:45:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743634480] [2022-04-28 05:45:49,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:45:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236949982] [2022-04-28 05:45:49,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236949982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:45:49,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:45:49,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:45:49,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:45:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167009315] [2022-04-28 05:45:49,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167009315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:45:49,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:45:49,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 05:45:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804308156] [2022-04-28 05:45:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:45:49,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2022-04-28 05:45:49,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:45:49,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 05:45:49,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:49,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 05:45:49,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:45:49,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 05:45:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 05:45:49,722 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 05:45:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:50,161 INFO L93 Difference]: Finished difference Result 209 states and 286 transitions. [2022-04-28 05:45:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 05:45:50,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2022-04-28 05:45:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:45:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 05:45:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-04-28 05:45:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 05:45:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2022-04-28 05:45:50,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2022-04-28 05:45:50,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:50,224 INFO L225 Difference]: With dead ends: 209 [2022-04-28 05:45:50,224 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 05:45:50,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:45:50,225 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 05:45:50,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 163 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 05:45:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 05:45:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2022-04-28 05:45:50,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:45:50,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:50,570 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:50,571 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:50,577 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2022-04-28 05:45:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2022-04-28 05:45:50,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:45:50,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:45:50,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 164 states. [2022-04-28 05:45:50,581 INFO L87 Difference]: Start difference. First operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 164 states. [2022-04-28 05:45:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:45:50,584 INFO L93 Difference]: Finished difference Result 164 states and 215 transitions. [2022-04-28 05:45:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2022-04-28 05:45:50,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:45:50,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:45:50,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:45:50,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:45:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.119047619047619) internal successors, (94), 86 states have internal predecessors, (94), 55 states have call successors, (55), 16 states have call predecessors, (55), 15 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:45:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2022-04-28 05:45:50,589 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 100 [2022-04-28 05:45:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:45:50,589 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2022-04-28 05:45:50,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-04-28 05:45:50,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 201 transitions. [2022-04-28 05:45:50,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:45:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2022-04-28 05:45:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 05:45:50,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:45:50,904 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:45:50,925 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 05:45:51,104 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 05:45:51,104 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:45:51,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:45:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 1 times [2022-04-28 05:45:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:45:51,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178796710] [2022-04-28 05:45:51,105 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:45:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash -428114403, now seen corresponding path program 2 times [2022-04-28 05:45:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:45:51,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036118601] [2022-04-28 05:45:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:45:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:45:51,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:45:51,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490777383] [2022-04-28 05:45:51,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:45:51,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:45:51,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:45:51,127 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 05:45:51,128 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 05:45:51,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:45:51,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:45:51,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 05:45:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:45:51,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:45:52,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {11296#true} call ULTIMATE.init(); {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {11296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11296#true} {11296#true} #103#return; {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {11296#true} call #t~ret6 := main(); {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {11296#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L272 TraceCheckUtils]: 6: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11296#true} {11296#true} #79#return; {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {11296#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L272 TraceCheckUtils]: 12: Hoare triple {11296#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11296#true} {11296#true} #81#return; {11296#true} is VALID [2022-04-28 05:45:52,615 INFO L272 TraceCheckUtils]: 17: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {11296#true} ~cond := #in~cond; {11355#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:45:52,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {11355#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {11359#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:45:52,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {11359#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {11359#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:45:52,620 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11359#(not (= |assume_abort_if_not_#in~cond| 0))} {11296#true} #83#return; {11366#(<= 1 main_~x~0)} is VALID [2022-04-28 05:45:52,620 INFO L272 TraceCheckUtils]: 22: Hoare triple {11366#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,621 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11296#true} {11366#(<= 1 main_~x~0)} #85#return; {11366#(<= 1 main_~x~0)} is VALID [2022-04-28 05:45:52,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {11366#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,622 INFO L272 TraceCheckUtils]: 28: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,622 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11296#true} {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,622 INFO L272 TraceCheckUtils]: 33: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,623 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11296#true} {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {11385#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,625 INFO L272 TraceCheckUtils]: 41: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,625 INFO L290 TraceCheckUtils]: 44: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,626 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,626 INFO L272 TraceCheckUtils]: 46: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,626 INFO L290 TraceCheckUtils]: 48: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,626 INFO L290 TraceCheckUtils]: 49: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,627 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,627 INFO L272 TraceCheckUtils]: 51: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,627 INFO L290 TraceCheckUtils]: 52: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,627 INFO L290 TraceCheckUtils]: 53: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,627 INFO L290 TraceCheckUtils]: 54: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,628 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,628 INFO L272 TraceCheckUtils]: 56: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,629 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11296#true} {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {11422#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,631 INFO L272 TraceCheckUtils]: 63: Hoare triple {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,631 INFO L290 TraceCheckUtils]: 64: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,631 INFO L290 TraceCheckUtils]: 65: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,631 INFO L290 TraceCheckUtils]: 66: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,632 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11296#true} {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,632 INFO L272 TraceCheckUtils]: 68: Hoare triple {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:52,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,633 INFO L290 TraceCheckUtils]: 71: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,634 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11489#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= (+ (- 1) main_~k~0) 0) (<= main_~b~0 main_~a~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,634 INFO L272 TraceCheckUtils]: 73: Hoare triple {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,634 INFO L290 TraceCheckUtils]: 74: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:52,635 INFO L290 TraceCheckUtils]: 75: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,636 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #95#return; {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,636 INFO L272 TraceCheckUtils]: 78: Hoare triple {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,636 INFO L290 TraceCheckUtils]: 79: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:52,636 INFO L290 TraceCheckUtils]: 80: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,637 INFO L290 TraceCheckUtils]: 81: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,637 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} #97#return; {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {11525#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 main_~b~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {11559#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:45:52,639 INFO L290 TraceCheckUtils]: 84: Hoare triple {11559#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= (+ main_~c~0 main_~y~0) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,640 INFO L290 TraceCheckUtils]: 85: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !false; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,640 INFO L290 TraceCheckUtils]: 86: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,640 INFO L290 TraceCheckUtils]: 87: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !false; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,641 INFO L272 TraceCheckUtils]: 88: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,641 INFO L290 TraceCheckUtils]: 89: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,641 INFO L290 TraceCheckUtils]: 90: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,641 INFO L290 TraceCheckUtils]: 91: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,641 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11296#true} {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #91#return; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,642 INFO L272 TraceCheckUtils]: 93: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,642 INFO L290 TraceCheckUtils]: 94: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:45:52,642 INFO L290 TraceCheckUtils]: 95: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:45:52,642 INFO L290 TraceCheckUtils]: 96: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:45:52,643 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11296#true} {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #93#return; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,643 INFO L272 TraceCheckUtils]: 98: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:45:52,643 INFO L290 TraceCheckUtils]: 99: Hoare triple {11296#true} ~cond := #in~cond; {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:52,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {11514#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,644 INFO L290 TraceCheckUtils]: 101: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:45:52,644 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #95#return; {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-28 05:45:52,646 INFO L272 TraceCheckUtils]: 103: Hoare triple {11563#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (< main_~x~0 (* main_~y~0 2)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= (+ main_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:45:52,646 INFO L290 TraceCheckUtils]: 104: Hoare triple {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11625#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:45:52,647 INFO L290 TraceCheckUtils]: 105: Hoare triple {11625#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11297#false} is VALID [2022-04-28 05:45:52,647 INFO L290 TraceCheckUtils]: 106: Hoare triple {11297#false} assume !false; {11297#false} is VALID [2022-04-28 05:45:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 90 proven. 49 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-04-28 05:45:52,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:47:34,910 WARN L232 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 05:47:48,028 INFO L290 TraceCheckUtils]: 106: Hoare triple {11297#false} assume !false; {11297#false} is VALID [2022-04-28 05:47:48,028 INFO L290 TraceCheckUtils]: 105: Hoare triple {11625#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11297#false} is VALID [2022-04-28 05:47:48,028 INFO L290 TraceCheckUtils]: 104: Hoare triple {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11625#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:47:48,029 INFO L272 TraceCheckUtils]: 103: Hoare triple {11641#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11621#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:47:48,030 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #95#return; {11641#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-28 05:47:48,030 INFO L290 TraceCheckUtils]: 101: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:48,030 INFO L290 TraceCheckUtils]: 100: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:48,031 INFO L290 TraceCheckUtils]: 99: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:48,031 INFO L272 TraceCheckUtils]: 98: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:48,032 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {11296#true} {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #93#return; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:47:48,032 INFO L290 TraceCheckUtils]: 96: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:48,032 INFO L290 TraceCheckUtils]: 95: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:48,032 INFO L290 TraceCheckUtils]: 94: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:48,032 INFO L272 TraceCheckUtils]: 93: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:48,033 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {11296#true} {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #91#return; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:47:48,033 INFO L290 TraceCheckUtils]: 91: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:48,033 INFO L290 TraceCheckUtils]: 90: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:48,033 INFO L290 TraceCheckUtils]: 89: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:48,033 INFO L272 TraceCheckUtils]: 88: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:48,033 INFO L290 TraceCheckUtils]: 87: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:47:48,034 INFO L290 TraceCheckUtils]: 86: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:47:48,034 INFO L290 TraceCheckUtils]: 85: Hoare triple {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:47:50,036 WARN L290 TraceCheckUtils]: 84: Hoare triple {11701#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {11645#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-28 05:47:50,037 INFO L290 TraceCheckUtils]: 83: Hoare triple {11705#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {11701#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,038 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11709#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #97#return; {11705#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:50,039 INFO L272 TraceCheckUtils]: 78: Hoare triple {11709#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,040 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11725#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #95#return; {11709#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:50,041 INFO L272 TraceCheckUtils]: 73: Hoare triple {11725#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,042 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #93#return; {11725#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,043 INFO L290 TraceCheckUtils]: 70: Hoare triple {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {11518#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:47:50,043 INFO L290 TraceCheckUtils]: 69: Hoare triple {11296#true} ~cond := #in~cond; {11655#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:47:50,043 INFO L272 TraceCheckUtils]: 68: Hoare triple {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,044 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11296#true} {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #91#return; {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,044 INFO L272 TraceCheckUtils]: 63: Hoare triple {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !false; {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {11741#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~c~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)) (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~c~0 main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:47:50,310 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #97#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 05:47:50,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,310 INFO L272 TraceCheckUtils]: 56: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,311 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #95#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 05:47:50,311 INFO L290 TraceCheckUtils]: 54: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,311 INFO L290 TraceCheckUtils]: 53: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,311 INFO L290 TraceCheckUtils]: 52: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,311 INFO L272 TraceCheckUtils]: 51: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,321 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #93#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 05:47:50,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,321 INFO L272 TraceCheckUtils]: 46: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,322 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11296#true} {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} #91#return; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 05:47:50,322 INFO L290 TraceCheckUtils]: 44: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,322 INFO L290 TraceCheckUtils]: 43: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,322 INFO L272 TraceCheckUtils]: 41: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} assume !false; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 05:47:50,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11775#(or (<= (* main_~b~0 2) main_~c~0) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) main_~c~0 (* (- 1) main_~b~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~c~0 (* (- 1) main_~b~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (<= main_~b~0 main_~c~0)))} is VALID [2022-04-28 05:47:50,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} assume !false; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:47:50,392 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11296#true} {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} #89#return; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:47:50,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,392 INFO L272 TraceCheckUtils]: 33: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,393 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11296#true} {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} #87#return; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:47:50,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,393 INFO L272 TraceCheckUtils]: 28: Hoare triple {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {11296#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {11842#(or (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~s~0 main_~yy~0) (* main_~y~0 main_~y~0 main_~r~0) (* main_~q~0 main_~xy~0) (* main_~p~0 main_~y~0 main_~x~0)) (+ (* main_~q~0 main_~y~0 main_~x~0) (* main_~y~0 main_~y~0 main_~s~0) (* main_~p~0 main_~xy~0) (* main_~r~0 main_~yy~0))) (<= (+ (* main_~q~0 main_~x~0) main_~b~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)))))} is VALID [2022-04-28 05:47:50,394 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11296#true} {11296#true} #85#return; {11296#true} is VALID [2022-04-28 05:47:50,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L272 TraceCheckUtils]: 22: Hoare triple {11296#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11296#true} {11296#true} #83#return; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L272 TraceCheckUtils]: 17: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11296#true} {11296#true} #81#return; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L272 TraceCheckUtils]: 12: Hoare triple {11296#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {11296#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11296#true} {11296#true} #79#return; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {11296#true} assume !(0 == ~cond); {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {11296#true} ~cond := #in~cond; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {11296#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {11296#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {11296#true} call #t~ret6 := main(); {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11296#true} {11296#true} #103#return; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {11296#true} assume true; {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {11296#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11296#true} is VALID [2022-04-28 05:47:50,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {11296#true} call ULTIMATE.init(); {11296#true} is VALID [2022-04-28 05:47:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 84 proven. 40 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-28 05:47:50,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:47:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036118601] [2022-04-28 05:47:50,397 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:47:50,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490777383] [2022-04-28 05:47:50,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490777383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:47:50,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:47:50,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-04-28 05:47:50,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:47:50,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178796710] [2022-04-28 05:47:50,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178796710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:47:50,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:47:50,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 05:47:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962117593] [2022-04-28 05:47:50,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:47:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 107 [2022-04-28 05:47:50,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:47:50,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 05:47:50,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:47:50,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 05:47:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:47:50,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 05:47:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-04-28 05:47:50,467 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 05:47:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:47:55,468 INFO L93 Difference]: Finished difference Result 162 states and 207 transitions. [2022-04-28 05:47:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:47:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 107 [2022-04-28 05:47:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:47:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 05:47:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-28 05:47:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 05:47:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 103 transitions. [2022-04-28 05:47:55,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 103 transitions. [2022-04-28 05:47:55,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:47:55,590 INFO L225 Difference]: With dead ends: 162 [2022-04-28 05:47:55,590 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 05:47:55,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2022-04-28 05:47:55,590 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 05:47:55,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 170 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 05:47:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 05:47:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-04-28 05:47:55,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:47:55,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:47:55,885 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:47:55,885 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:47:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:47:55,894 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-28 05:47:55,894 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-28 05:47:55,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:47:55,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:47:55,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 160 states. [2022-04-28 05:47:55,895 INFO L87 Difference]: Start difference. First operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand 160 states. [2022-04-28 05:47:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:47:55,901 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2022-04-28 05:47:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2022-04-28 05:47:55,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:47:55,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:47:55,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:47:55,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:47:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 89 states have internal predecessors, (97), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-28 05:47:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 204 transitions. [2022-04-28 05:47:55,905 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 204 transitions. Word has length 107 [2022-04-28 05:47:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:47:55,905 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 204 transitions. [2022-04-28 05:47:55,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 7 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2022-04-28 05:47:55,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 204 transitions. [2022-04-28 05:47:56,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:47:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 204 transitions. [2022-04-28 05:47:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 05:47:56,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:47:56,236 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:47:56,255 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 05:47:56,454 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 05:47:56,454 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:47:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:47:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1185765869, now seen corresponding path program 3 times [2022-04-28 05:47:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:47:56,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211331371] [2022-04-28 05:47:56,455 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:47:56,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1185765869, now seen corresponding path program 4 times [2022-04-28 05:47:56,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:47:56,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518526829] [2022-04-28 05:47:56,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:47:56,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:47:56,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:47:56,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65299061] [2022-04-28 05:47:56,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:47:56,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:47:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:47:56,470 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 05:47:56,474 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 05:47:56,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:47:56,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:47:56,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 05:47:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:47:56,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:48:04,646 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:48:06,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {12932#true} call ULTIMATE.init(); {12932#true} is VALID [2022-04-28 05:48:06,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {12932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12932#true} {12932#true} #103#return; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {12932#true} call #t~ret6 := main(); {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {12932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12932#true} {12932#true} #79#return; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {12932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L272 TraceCheckUtils]: 12: Hoare triple {12932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,311 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12932#true} {12932#true} #81#return; {12932#true} is VALID [2022-04-28 05:48:06,311 INFO L272 TraceCheckUtils]: 17: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {12932#true} ~cond := #in~cond; {12991#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:48:06,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {12991#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12995#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:48:06,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {12995#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12995#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:48:06,313 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12995#(not (= |assume_abort_if_not_#in~cond| 0))} {12932#true} #83#return; {13002#(<= 1 main_~x~0)} is VALID [2022-04-28 05:48:06,313 INFO L272 TraceCheckUtils]: 22: Hoare triple {13002#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,314 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12932#true} {13002#(<= 1 main_~x~0)} #85#return; {13002#(<= 1 main_~x~0)} is VALID [2022-04-28 05:48:06,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {13002#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,314 INFO L272 TraceCheckUtils]: 28: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,315 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12932#true} {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,315 INFO L272 TraceCheckUtils]: 33: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,316 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12932#true} {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {13021#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,317 INFO L290 TraceCheckUtils]: 40: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,317 INFO L272 TraceCheckUtils]: 41: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,317 INFO L290 TraceCheckUtils]: 42: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,317 INFO L290 TraceCheckUtils]: 43: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,317 INFO L290 TraceCheckUtils]: 44: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,317 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,317 INFO L272 TraceCheckUtils]: 46: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,317 INFO L290 TraceCheckUtils]: 47: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,318 INFO L290 TraceCheckUtils]: 48: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,318 INFO L290 TraceCheckUtils]: 49: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,318 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,318 INFO L272 TraceCheckUtils]: 51: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,321 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,321 INFO L272 TraceCheckUtils]: 56: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,321 INFO L290 TraceCheckUtils]: 57: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,322 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12932#true} {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {13058#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,323 INFO L290 TraceCheckUtils]: 62: Hoare triple {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,323 INFO L272 TraceCheckUtils]: 63: Hoare triple {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,323 INFO L290 TraceCheckUtils]: 64: Hoare triple {12932#true} ~cond := #in~cond; {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:48:06,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:48:06,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:48:06,324 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13125#(and (= main_~r~0 0) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,325 INFO L272 TraceCheckUtils]: 68: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,325 INFO L290 TraceCheckUtils]: 69: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,325 INFO L290 TraceCheckUtils]: 70: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,325 INFO L290 TraceCheckUtils]: 71: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,325 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12932#true} {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,325 INFO L272 TraceCheckUtils]: 73: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,326 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12932#true} {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,326 INFO L272 TraceCheckUtils]: 78: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,326 INFO L290 TraceCheckUtils]: 81: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,327 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12932#true} {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {13146#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,328 INFO L272 TraceCheckUtils]: 85: Hoare triple {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,328 INFO L290 TraceCheckUtils]: 86: Hoare triple {12932#true} ~cond := #in~cond; {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:48:06,328 INFO L290 TraceCheckUtils]: 87: Hoare triple {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:48:06,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:48:06,329 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13195#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {13214#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,329 INFO L272 TraceCheckUtils]: 90: Hoare triple {13214#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,330 INFO L290 TraceCheckUtils]: 91: Hoare triple {12932#true} ~cond := #in~cond; {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:48:06,330 INFO L290 TraceCheckUtils]: 92: Hoare triple {13135#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:48:06,330 INFO L290 TraceCheckUtils]: 93: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:48:06,331 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13214#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,331 INFO L272 TraceCheckUtils]: 95: Hoare triple {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,331 INFO L290 TraceCheckUtils]: 96: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,331 INFO L290 TraceCheckUtils]: 97: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,331 INFO L290 TraceCheckUtils]: 98: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,332 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12932#true} {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #95#return; {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,332 INFO L272 TraceCheckUtils]: 100: Hoare triple {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:48:06,332 INFO L290 TraceCheckUtils]: 101: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:48:06,332 INFO L290 TraceCheckUtils]: 102: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:48:06,332 INFO L290 TraceCheckUtils]: 103: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:48:06,333 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12932#true} {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} #97#return; {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,333 INFO L290 TraceCheckUtils]: 105: Hoare triple {13230#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~s~0 1) (<= 2 main_~k~0) (<= 0 main_~c~0) (= main_~b~0 main_~y~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {13264#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:48:06,334 INFO L290 TraceCheckUtils]: 106: Hoare triple {13264#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (<= 0 main_~c~0) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= (* main_~y~0 2) (* main_~k~0 main_~y~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:48:06,335 INFO L290 TraceCheckUtils]: 107: Hoare triple {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} assume !false; {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} is VALID [2022-04-28 05:48:06,335 INFO L290 TraceCheckUtils]: 108: Hoare triple {13268#(and (<= 0 (+ main_~x~0 (* main_~y~0 main_~s~0))) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (* main_~y~0 (* (- 1) main_~s~0)) (* main_~y~0 2)) (= main_~q~0 1))} assume !(0 != ~b~0); {13275#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ (* main_~y~0 2) (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-28 05:48:06,336 INFO L272 TraceCheckUtils]: 109: Hoare triple {13275#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ (* main_~y~0 2) (* main_~y~0 main_~s~0)) 0) (< (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:48:06,336 INFO L290 TraceCheckUtils]: 110: Hoare triple {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:48:06,336 INFO L290 TraceCheckUtils]: 111: Hoare triple {13283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12933#false} is VALID [2022-04-28 05:48:06,336 INFO L290 TraceCheckUtils]: 112: Hoare triple {12933#false} assume !false; {12933#false} is VALID [2022-04-28 05:48:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 81 proven. 59 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-04-28 05:48:06,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:49:57,982 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:49:58,020 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:50:32,907 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:50:55,254 INFO L290 TraceCheckUtils]: 112: Hoare triple {12933#false} assume !false; {12933#false} is VALID [2022-04-28 05:50:55,255 INFO L290 TraceCheckUtils]: 111: Hoare triple {13283#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12933#false} is VALID [2022-04-28 05:50:55,255 INFO L290 TraceCheckUtils]: 110: Hoare triple {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13283#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:50:55,256 INFO L272 TraceCheckUtils]: 109: Hoare triple {13299#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {13279#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:50:55,256 INFO L290 TraceCheckUtils]: 108: Hoare triple {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {13299#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-28 05:50:55,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !false; {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-28 05:50:57,258 WARN L290 TraceCheckUtils]: 106: Hoare triple {13310#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {13303#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is UNKNOWN [2022-04-28 05:50:57,259 INFO L290 TraceCheckUtils]: 105: Hoare triple {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !(~c~0 >= ~b~0); {13310#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:50:57,259 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12932#true} {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #97#return; {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:50:57,260 INFO L290 TraceCheckUtils]: 103: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:50:57,260 INFO L290 TraceCheckUtils]: 102: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:50:57,260 INFO L290 TraceCheckUtils]: 101: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:50:57,260 INFO L272 TraceCheckUtils]: 100: Hoare triple {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:57,260 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {12932#true} {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #95#return; {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:50:57,261 INFO L290 TraceCheckUtils]: 98: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:50:57,261 INFO L290 TraceCheckUtils]: 97: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:50:57,261 INFO L290 TraceCheckUtils]: 96: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:50:57,261 INFO L272 TraceCheckUtils]: 95: Hoare triple {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:57,262 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13348#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #93#return; {13314#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:50:57,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,262 INFO L290 TraceCheckUtils]: 92: Hoare triple {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,263 INFO L290 TraceCheckUtils]: 91: Hoare triple {12932#true} ~cond := #in~cond; {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:57,263 INFO L272 TraceCheckUtils]: 90: Hoare triple {13348#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:57,264 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} #91#return; {13348#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:50:57,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:57,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {12932#true} ~cond := #in~cond; {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:57,265 INFO L272 TraceCheckUtils]: 85: Hoare triple {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:57,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} assume !false; {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is VALID [2022-04-28 05:50:59,267 WARN L290 TraceCheckUtils]: 83: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13365#(or (not (= main_~c~0 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) 0))} is UNKNOWN [2022-04-28 05:50:59,268 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {12932#true} {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #97#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:50:59,268 INFO L290 TraceCheckUtils]: 81: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:50:59,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:50:59,268 INFO L290 TraceCheckUtils]: 79: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:50:59,269 INFO L272 TraceCheckUtils]: 78: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:59,269 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12932#true} {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #95#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:50:59,269 INFO L290 TraceCheckUtils]: 76: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:50:59,269 INFO L290 TraceCheckUtils]: 75: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:50:59,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:50:59,270 INFO L272 TraceCheckUtils]: 73: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:59,270 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {12932#true} {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #93#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:50:59,270 INFO L290 TraceCheckUtils]: 71: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:50:59,270 INFO L290 TraceCheckUtils]: 70: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:50:59,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:50:59,271 INFO L272 TraceCheckUtils]: 68: Hoare triple {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:59,272 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} #91#return; {13384#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div main_~a~0 main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* (+ (* (- 1) (* main_~s~0 (div main_~a~0 main_~b~0))) main_~r~0) main_~y~0) (* (+ (* (- 1) main_~q~0 (div main_~a~0 main_~b~0)) main_~p~0) main_~x~0)) 0) (not (<= main_~b~0 main_~c~0)) (not (= (+ main_~a~0 (* (- 1) main_~b~0 (div main_~a~0 main_~b~0))) (+ main_~c~0 (* (- 1) main_~b~0)))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:50:59,272 INFO L290 TraceCheckUtils]: 66: Hoare triple {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:59,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:50:59,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {12932#true} ~cond := #in~cond; {13358#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:50:59,273 INFO L272 TraceCheckUtils]: 63: Hoare triple {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:50:59,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} assume !false; {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} is VALID [2022-04-28 05:51:01,276 WARN L290 TraceCheckUtils]: 61: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {13433#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (< main_~c~0 main_~b~0) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* main_~b~0 (div main_~a~0 main_~b~0))))))} is UNKNOWN [2022-04-28 05:51:01,277 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #97#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,277 INFO L272 TraceCheckUtils]: 56: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,278 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #95#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,278 INFO L272 TraceCheckUtils]: 51: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,279 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #93#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,279 INFO L290 TraceCheckUtils]: 49: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,279 INFO L290 TraceCheckUtils]: 48: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,279 INFO L290 TraceCheckUtils]: 47: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,279 INFO L272 TraceCheckUtils]: 46: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,280 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12932#true} {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #91#return; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,280 INFO L272 TraceCheckUtils]: 41: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !false; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,281 INFO L290 TraceCheckUtils]: 39: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13452#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (+ main_~b~0 main_~a~0) (+ main_~c~0 (* (- 1) main_~b~0) (* main_~b~0 (div main_~a~0 main_~b~0))))) (not (= (mod (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0) 0)) (not (<= (+ main_~k~0 1) (div (+ (* (- 1) main_~c~0) main_~b~0 main_~a~0) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~c~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} assume !false; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,283 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12932#true} {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #89#return; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,283 INFO L272 TraceCheckUtils]: 33: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,284 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12932#true} {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} #87#return; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,284 INFO L272 TraceCheckUtils]: 28: Hoare triple {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {12932#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {13519#(or (not (= (mod main_~a~0 main_~b~0) 0)) (not (= (* main_~b~0 (div main_~a~0 main_~b~0)) (* main_~b~0 2))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (< main_~a~0 (* main_~b~0 2)) (= (+ (* main_~y~0 main_~s~0 (div main_~a~0 main_~b~0)) (* main_~q~0 main_~x~0 (div main_~a~0 main_~b~0))) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (<= (+ main_~b~0 (* main_~b~0 (div main_~a~0 main_~b~0))) main_~a~0))} is VALID [2022-04-28 05:51:01,285 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {12932#true} {12932#true} #85#return; {12932#true} is VALID [2022-04-28 05:51:01,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L272 TraceCheckUtils]: 22: Hoare triple {12932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {12932#true} {12932#true} #83#return; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L272 TraceCheckUtils]: 17: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12932#true} {12932#true} #81#return; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L272 TraceCheckUtils]: 12: Hoare triple {12932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {12932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12932#true} {12932#true} #79#return; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {12932#true} assume !(0 == ~cond); {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {12932#true} ~cond := #in~cond; {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L272 TraceCheckUtils]: 6: Hoare triple {12932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {12932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {12932#true} call #t~ret6 := main(); {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12932#true} {12932#true} #103#return; {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {12932#true} assume true; {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {12932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12932#true} is VALID [2022-04-28 05:51:01,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {12932#true} call ULTIMATE.init(); {12932#true} is VALID [2022-04-28 05:51:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 75 proven. 50 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-04-28 05:51:01,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518526829] [2022-04-28 05:51:01,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65299061] [2022-04-28 05:51:01,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65299061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:01,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:01,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-28 05:51:01,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211331371] [2022-04-28 05:51:01,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211331371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:01,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:01,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 05:51:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314896214] [2022-04-28 05:51:01,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:01,289 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 113 [2022-04-28 05:51:01,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:01,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-28 05:51:01,362 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 05:51:01,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 05:51:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:01,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 05:51:01,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=714, Unknown=2, NotChecked=0, Total=870 [2022-04-28 05:51:01,363 INFO L87 Difference]: Start difference. First operand 159 states and 204 transitions. Second operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-28 05:51:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:09,676 INFO L93 Difference]: Finished difference Result 192 states and 250 transitions. [2022-04-28 05:51:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 05:51:09,677 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 113 [2022-04-28 05:51:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-28 05:51:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-04-28 05:51:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-28 05:51:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2022-04-28 05:51:09,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 117 transitions. [2022-04-28 05:51:09,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:09,818 INFO L225 Difference]: With dead ends: 192 [2022-04-28 05:51:09,818 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 05:51:09,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=202, Invalid=986, Unknown=2, NotChecked=0, Total=1190 [2022-04-28 05:51:09,818 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 45 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:09,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 05:51:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 05:51:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2022-04-28 05:51:10,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:10,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:51:10,237 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:51:10,237 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:51:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:10,240 INFO L93 Difference]: Finished difference Result 189 states and 246 transitions. [2022-04-28 05:51:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2022-04-28 05:51:10,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:10,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:10,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand 189 states. [2022-04-28 05:51:10,261 INFO L87 Difference]: Start difference. First operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand 189 states. [2022-04-28 05:51:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:10,269 INFO L93 Difference]: Finished difference Result 189 states and 246 transitions. [2022-04-28 05:51:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2022-04-28 05:51:10,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:10,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:10,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:10,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 67 states have call successors, (67), 19 states have call predecessors, (67), 18 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-28 05:51:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 245 transitions. [2022-04-28 05:51:10,274 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 245 transitions. Word has length 113 [2022-04-28 05:51:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:10,274 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 245 transitions. [2022-04-28 05:51:10,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 10 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-28 05:51:10,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 245 transitions. [2022-04-28 05:51:10,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 245 transitions. [2022-04-28 05:51:10,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-28 05:51:10,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:10,638 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:51:10,664 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 05:51:10,838 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 05:51:10,839 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 884638574, now seen corresponding path program 5 times [2022-04-28 05:51:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:10,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085623864] [2022-04-28 05:51:10,840 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash 884638574, now seen corresponding path program 6 times [2022-04-28 05:51:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:10,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263348812] [2022-04-28 05:51:10,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:10,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:10,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384649854] [2022-04-28 05:51:10,850 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:51:10,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:10,853 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 05:51:10,855 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 05:51:10,908 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:51:10,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:10,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 05:51:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:10,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:11,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {14787#true} call ULTIMATE.init(); {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {14787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14787#true} {14787#true} #103#return; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {14787#true} call #t~ret6 := main(); {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {14787#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14787#true} {14787#true} #79#return; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {14787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L272 TraceCheckUtils]: 12: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14787#true} {14787#true} #81#return; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L272 TraceCheckUtils]: 17: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14787#true} {14787#true} #83#return; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L272 TraceCheckUtils]: 22: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14787#true} {14787#true} #85#return; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {14787#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14787#true} is VALID [2022-04-28 05:51:11,183 INFO L272 TraceCheckUtils]: 28: Hoare triple {14787#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14787#true} {14787#true} #87#return; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L272 TraceCheckUtils]: 33: Hoare triple {14787#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 34: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 35: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 36: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14787#true} {14787#true} #89#return; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {14787#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L272 TraceCheckUtils]: 41: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14787#true} {14787#true} #91#return; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L272 TraceCheckUtils]: 46: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 47: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14787#true} {14787#true} #93#return; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L272 TraceCheckUtils]: 51: Hoare triple {14787#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14787#true} {14787#true} #95#return; {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L272 TraceCheckUtils]: 56: Hoare triple {14787#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,186 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14787#true} {14787#true} #97#return; {14787#true} is VALID [2022-04-28 05:51:11,204 INFO L290 TraceCheckUtils]: 61: Hoare triple {14787#true} assume !(~c~0 >= ~b~0); {14975#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:11,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {14975#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:51:11,204 INFO L290 TraceCheckUtils]: 63: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !false; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:51:11,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !false; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,205 INFO L272 TraceCheckUtils]: 66: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,205 INFO L290 TraceCheckUtils]: 68: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,205 INFO L290 TraceCheckUtils]: 69: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,205 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #91#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,206 INFO L272 TraceCheckUtils]: 71: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L290 TraceCheckUtils]: 72: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #93#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,206 INFO L272 TraceCheckUtils]: 76: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,206 INFO L290 TraceCheckUtils]: 79: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,207 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #95#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,207 INFO L272 TraceCheckUtils]: 81: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,207 INFO L290 TraceCheckUtils]: 82: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,207 INFO L290 TraceCheckUtils]: 83: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,207 INFO L290 TraceCheckUtils]: 84: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,208 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #97#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,208 INFO L290 TraceCheckUtils]: 86: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 87: Hoare triple {15053#(< 0 main_~c~0)} assume !false; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,209 INFO L272 TraceCheckUtils]: 88: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 89: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 90: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 91: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #91#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,209 INFO L272 TraceCheckUtils]: 93: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 94: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 95: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,209 INFO L290 TraceCheckUtils]: 96: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,210 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #93#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,210 INFO L272 TraceCheckUtils]: 98: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,210 INFO L290 TraceCheckUtils]: 99: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,210 INFO L290 TraceCheckUtils]: 100: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,210 INFO L290 TraceCheckUtils]: 101: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,210 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #95#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,211 INFO L272 TraceCheckUtils]: 103: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,211 INFO L290 TraceCheckUtils]: 104: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,211 INFO L290 TraceCheckUtils]: 105: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,211 INFO L290 TraceCheckUtils]: 106: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,211 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #97#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,211 INFO L290 TraceCheckUtils]: 108: Hoare triple {15053#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,212 INFO L290 TraceCheckUtils]: 109: Hoare triple {15053#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15123#(< 0 main_~b~0)} is VALID [2022-04-28 05:51:11,212 INFO L290 TraceCheckUtils]: 110: Hoare triple {15123#(< 0 main_~b~0)} assume !false; {15123#(< 0 main_~b~0)} is VALID [2022-04-28 05:51:11,212 INFO L290 TraceCheckUtils]: 111: Hoare triple {15123#(< 0 main_~b~0)} assume !(0 != ~b~0); {14788#false} is VALID [2022-04-28 05:51:11,212 INFO L272 TraceCheckUtils]: 112: Hoare triple {14788#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14788#false} is VALID [2022-04-28 05:51:11,212 INFO L290 TraceCheckUtils]: 113: Hoare triple {14788#false} ~cond := #in~cond; {14788#false} is VALID [2022-04-28 05:51:11,212 INFO L290 TraceCheckUtils]: 114: Hoare triple {14788#false} assume 0 == ~cond; {14788#false} is VALID [2022-04-28 05:51:11,212 INFO L290 TraceCheckUtils]: 115: Hoare triple {14788#false} assume !false; {14788#false} is VALID [2022-04-28 05:51:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-28 05:51:11,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:11,429 INFO L290 TraceCheckUtils]: 115: Hoare triple {14788#false} assume !false; {14788#false} is VALID [2022-04-28 05:51:11,429 INFO L290 TraceCheckUtils]: 114: Hoare triple {14788#false} assume 0 == ~cond; {14788#false} is VALID [2022-04-28 05:51:11,429 INFO L290 TraceCheckUtils]: 113: Hoare triple {14788#false} ~cond := #in~cond; {14788#false} is VALID [2022-04-28 05:51:11,429 INFO L272 TraceCheckUtils]: 112: Hoare triple {14788#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {14788#false} is VALID [2022-04-28 05:51:11,429 INFO L290 TraceCheckUtils]: 111: Hoare triple {15123#(< 0 main_~b~0)} assume !(0 != ~b~0); {14788#false} is VALID [2022-04-28 05:51:11,429 INFO L290 TraceCheckUtils]: 110: Hoare triple {15123#(< 0 main_~b~0)} assume !false; {15123#(< 0 main_~b~0)} is VALID [2022-04-28 05:51:11,430 INFO L290 TraceCheckUtils]: 109: Hoare triple {15053#(< 0 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {15123#(< 0 main_~b~0)} is VALID [2022-04-28 05:51:11,430 INFO L290 TraceCheckUtils]: 108: Hoare triple {15053#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,430 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #97#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,430 INFO L290 TraceCheckUtils]: 106: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,431 INFO L290 TraceCheckUtils]: 104: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,431 INFO L272 TraceCheckUtils]: 103: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,431 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #95#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,431 INFO L290 TraceCheckUtils]: 101: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,431 INFO L290 TraceCheckUtils]: 100: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,431 INFO L290 TraceCheckUtils]: 99: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,431 INFO L272 TraceCheckUtils]: 98: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #93#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,432 INFO L290 TraceCheckUtils]: 96: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L290 TraceCheckUtils]: 95: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L290 TraceCheckUtils]: 94: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L272 TraceCheckUtils]: 93: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {14787#true} {15053#(< 0 main_~c~0)} #91#return; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,432 INFO L290 TraceCheckUtils]: 91: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L290 TraceCheckUtils]: 90: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L290 TraceCheckUtils]: 89: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,432 INFO L272 TraceCheckUtils]: 88: Hoare triple {15053#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {15053#(< 0 main_~c~0)} assume !false; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15053#(< 0 main_~c~0)} is VALID [2022-04-28 05:51:11,434 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #97#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,434 INFO L290 TraceCheckUtils]: 83: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,434 INFO L290 TraceCheckUtils]: 82: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,434 INFO L272 TraceCheckUtils]: 81: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,434 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #95#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,434 INFO L290 TraceCheckUtils]: 79: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,434 INFO L290 TraceCheckUtils]: 78: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L272 TraceCheckUtils]: 76: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #93#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L272 TraceCheckUtils]: 71: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,435 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {14787#true} {14986#(< main_~b~0 main_~c~0)} #91#return; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,436 INFO L290 TraceCheckUtils]: 69: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,436 INFO L290 TraceCheckUtils]: 68: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,436 INFO L272 TraceCheckUtils]: 66: Hoare triple {14986#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {14986#(< main_~b~0 main_~c~0)} assume !false; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14986#(< main_~b~0 main_~c~0)} is VALID [2022-04-28 05:51:11,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {14979#(< main_~b~0 main_~a~0)} assume !false; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {14975#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {14979#(< main_~b~0 main_~a~0)} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {14787#true} assume !(~c~0 >= ~b~0); {14975#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:11,437 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14787#true} {14787#true} #97#return; {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L272 TraceCheckUtils]: 56: Hoare triple {14787#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14787#true} {14787#true} #95#return; {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,437 INFO L272 TraceCheckUtils]: 51: Hoare triple {14787#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14787#true} {14787#true} #93#return; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L272 TraceCheckUtils]: 46: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14787#true} {14787#true} #91#return; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 44: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 42: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L272 TraceCheckUtils]: 41: Hoare triple {14787#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {14787#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {14787#true} assume !false; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14787#true} {14787#true} #89#return; {14787#true} is VALID [2022-04-28 05:51:11,438 INFO L290 TraceCheckUtils]: 36: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 34: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L272 TraceCheckUtils]: 33: Hoare triple {14787#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {14787#true} {14787#true} #87#return; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L272 TraceCheckUtils]: 28: Hoare triple {14787#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {14787#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14787#true} {14787#true} #85#return; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L272 TraceCheckUtils]: 22: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,439 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14787#true} {14787#true} #83#return; {14787#true} is VALID [2022-04-28 05:51:11,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,440 INFO L272 TraceCheckUtils]: 17: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,440 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {14787#true} {14787#true} #81#return; {14787#true} is VALID [2022-04-28 05:51:11,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L272 TraceCheckUtils]: 12: Hoare triple {14787#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {14787#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14787#true} {14787#true} #79#return; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {14787#true} assume !(0 == ~cond); {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {14787#true} ~cond := #in~cond; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {14787#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {14787#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {14787#true} call #t~ret6 := main(); {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14787#true} {14787#true} #103#return; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {14787#true} assume true; {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {14787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14787#true} is VALID [2022-04-28 05:51:11,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {14787#true} call ULTIMATE.init(); {14787#true} is VALID [2022-04-28 05:51:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-28 05:51:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:11,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263348812] [2022-04-28 05:51:11,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:11,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384649854] [2022-04-28 05:51:11,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384649854] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:11,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:11,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-28 05:51:11,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:11,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085623864] [2022-04-28 05:51:11,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085623864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:11,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:11,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 05:51:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2567912] [2022-04-28 05:51:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 116 [2022-04-28 05:51:11,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:11,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 05:51:11,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 05:51:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 05:51:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 05:51:11,479 INFO L87 Difference]: Start difference. First operand 188 states and 245 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 05:51:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:12,720 INFO L93 Difference]: Finished difference Result 248 states and 345 transitions. [2022-04-28 05:51:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:51:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 116 [2022-04-28 05:51:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 05:51:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-28 05:51:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 05:51:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2022-04-28 05:51:12,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 126 transitions. [2022-04-28 05:51:12,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:12,844 INFO L225 Difference]: With dead ends: 248 [2022-04-28 05:51:12,844 INFO L226 Difference]: Without dead ends: 240 [2022-04-28 05:51:12,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-04-28 05:51:12,845 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:12,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 05:51:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-28 05:51:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 221. [2022-04-28 05:51:13,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:13,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:51:13,316 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:51:13,316 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:51:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:13,321 INFO L93 Difference]: Finished difference Result 240 states and 336 transitions. [2022-04-28 05:51:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 336 transitions. [2022-04-28 05:51:13,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:13,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:13,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand 240 states. [2022-04-28 05:51:13,322 INFO L87 Difference]: Start difference. First operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand 240 states. [2022-04-28 05:51:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:13,327 INFO L93 Difference]: Finished difference Result 240 states and 336 transitions. [2022-04-28 05:51:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 336 transitions. [2022-04-28 05:51:13,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:13,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:13,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:13,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 117 states have internal predecessors, (132), 87 states have call successors, (87), 19 states have call predecessors, (87), 18 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-28 05:51:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 303 transitions. [2022-04-28 05:51:13,333 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 303 transitions. Word has length 116 [2022-04-28 05:51:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:13,333 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 303 transitions. [2022-04-28 05:51:13,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-04-28 05:51:13,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 303 transitions. [2022-04-28 05:51:13,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 303 transitions. [2022-04-28 05:51:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 05:51:13,888 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:13,889 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:51:13,907 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 05:51:14,099 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 05:51:14,099 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -743412771, now seen corresponding path program 3 times [2022-04-28 05:51:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:14,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1235595525] [2022-04-28 05:51:14,100 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -743412771, now seen corresponding path program 4 times [2022-04-28 05:51:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:14,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984628072] [2022-04-28 05:51:14,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:14,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:14,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259970991] [2022-04-28 05:51:14,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:51:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:14,110 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 05:51:14,129 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 05:51:14,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:51:14,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:14,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 05:51:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:14,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:14,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {16926#true} call ULTIMATE.init(); {16926#true} is VALID [2022-04-28 05:51:14,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {16926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16926#true} is VALID [2022-04-28 05:51:14,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16926#true} {16926#true} #103#return; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {16926#true} call #t~ret6 := main(); {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {16926#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16926#true} {16926#true} #79#return; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {16926#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16926#true} {16926#true} #81#return; {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L272 TraceCheckUtils]: 17: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16926#true} {16926#true} #83#return; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L272 TraceCheckUtils]: 22: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16926#true} {16926#true} #85#return; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {16926#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L272 TraceCheckUtils]: 28: Hoare triple {16926#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16926#true} {16926#true} #87#return; {16926#true} is VALID [2022-04-28 05:51:14,435 INFO L272 TraceCheckUtils]: 33: Hoare triple {16926#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16926#true} {16926#true} #89#return; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L272 TraceCheckUtils]: 41: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L272 TraceCheckUtils]: 46: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L272 TraceCheckUtils]: 51: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 54: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L272 TraceCheckUtils]: 56: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 58: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {16926#true} assume !(~c~0 >= ~b~0); {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {16926#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16926#true} is VALID [2022-04-28 05:51:14,437 INFO L290 TraceCheckUtils]: 63: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 64: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 65: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L272 TraceCheckUtils]: 66: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 67: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 68: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 69: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L272 TraceCheckUtils]: 71: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 73: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L272 TraceCheckUtils]: 76: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 77: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,438 INFO L290 TraceCheckUtils]: 78: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L272 TraceCheckUtils]: 81: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 82: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 83: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 84: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 86: Hoare triple {16926#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 87: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L272 TraceCheckUtils]: 88: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 89: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 90: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L290 TraceCheckUtils]: 91: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-28 05:51:14,439 INFO L272 TraceCheckUtils]: 93: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,440 INFO L290 TraceCheckUtils]: 94: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,440 INFO L290 TraceCheckUtils]: 95: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,440 INFO L290 TraceCheckUtils]: 96: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,440 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-28 05:51:14,440 INFO L272 TraceCheckUtils]: 98: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,440 INFO L290 TraceCheckUtils]: 99: Hoare triple {16926#true} ~cond := #in~cond; {17228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:14,440 INFO L290 TraceCheckUtils]: 100: Hoare triple {17228#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:14,440 INFO L290 TraceCheckUtils]: 101: Hoare triple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:14,441 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} {16926#true} #95#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:14,441 INFO L272 TraceCheckUtils]: 103: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,441 INFO L290 TraceCheckUtils]: 104: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,441 INFO L290 TraceCheckUtils]: 105: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,441 INFO L290 TraceCheckUtils]: 106: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,442 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16926#true} {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:14,442 INFO L290 TraceCheckUtils]: 108: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:14,442 INFO L290 TraceCheckUtils]: 109: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:14,442 INFO L290 TraceCheckUtils]: 110: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:14,443 INFO L290 TraceCheckUtils]: 111: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:14,443 INFO L290 TraceCheckUtils]: 112: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:14,443 INFO L272 TraceCheckUtils]: 113: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:14,443 INFO L290 TraceCheckUtils]: 114: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:14,443 INFO L290 TraceCheckUtils]: 115: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:14,443 INFO L290 TraceCheckUtils]: 116: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:14,443 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {16926#true} {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:14,444 INFO L272 TraceCheckUtils]: 118: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:14,444 INFO L290 TraceCheckUtils]: 119: Hoare triple {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:14,444 INFO L290 TraceCheckUtils]: 120: Hoare triple {17293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16927#false} is VALID [2022-04-28 05:51:14,444 INFO L290 TraceCheckUtils]: 121: Hoare triple {16927#false} assume !false; {16927#false} is VALID [2022-04-28 05:51:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-28 05:51:14,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:24,635 INFO L290 TraceCheckUtils]: 121: Hoare triple {16927#false} assume !false; {16927#false} is VALID [2022-04-28 05:51:24,636 INFO L290 TraceCheckUtils]: 120: Hoare triple {17293#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16927#false} is VALID [2022-04-28 05:51:24,636 INFO L290 TraceCheckUtils]: 119: Hoare triple {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17293#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:24,637 INFO L272 TraceCheckUtils]: 118: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {17289#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:24,637 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {16926#true} {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #91#return; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:24,637 INFO L290 TraceCheckUtils]: 116: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,637 INFO L290 TraceCheckUtils]: 115: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,637 INFO L290 TraceCheckUtils]: 114: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,638 INFO L272 TraceCheckUtils]: 113: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,638 INFO L290 TraceCheckUtils]: 112: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:24,638 INFO L290 TraceCheckUtils]: 111: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:24,639 INFO L290 TraceCheckUtils]: 110: Hoare triple {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !false; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:24,639 INFO L290 TraceCheckUtils]: 109: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17261#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-28 05:51:24,639 INFO L290 TraceCheckUtils]: 108: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:24,640 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {16926#true} {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #97#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:24,640 INFO L290 TraceCheckUtils]: 106: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,640 INFO L290 TraceCheckUtils]: 105: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,640 INFO L290 TraceCheckUtils]: 104: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,640 INFO L272 TraceCheckUtils]: 103: Hoare triple {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,641 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} {16926#true} #95#return; {17239#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:24,641 INFO L290 TraceCheckUtils]: 101: Hoare triple {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:24,641 INFO L290 TraceCheckUtils]: 100: Hoare triple {17366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {17232#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:24,641 INFO L290 TraceCheckUtils]: 99: Hoare triple {16926#true} ~cond := #in~cond; {17366#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:51:24,642 INFO L272 TraceCheckUtils]: 98: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 96: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 95: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 94: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L272 TraceCheckUtils]: 93: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 91: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 90: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 89: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L272 TraceCheckUtils]: 88: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 86: Hoare triple {16926#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-28 05:51:24,642 INFO L290 TraceCheckUtils]: 84: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L272 TraceCheckUtils]: 81: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 79: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 78: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 77: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L272 TraceCheckUtils]: 76: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 74: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L272 TraceCheckUtils]: 71: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-28 05:51:24,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L272 TraceCheckUtils]: 66: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {16926#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {16926#true} assume !(~c~0 >= ~b~0); {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {16926#true} {16926#true} #97#return; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L272 TraceCheckUtils]: 56: Hoare triple {16926#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16926#true} {16926#true} #95#return; {16926#true} is VALID [2022-04-28 05:51:24,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L272 TraceCheckUtils]: 51: Hoare triple {16926#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {16926#true} {16926#true} #93#return; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 47: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L272 TraceCheckUtils]: 46: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16926#true} {16926#true} #91#return; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L272 TraceCheckUtils]: 41: Hoare triple {16926#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:24,645 INFO L290 TraceCheckUtils]: 39: Hoare triple {16926#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 38: Hoare triple {16926#true} assume !false; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {16926#true} {16926#true} #89#return; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L272 TraceCheckUtils]: 33: Hoare triple {16926#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {16926#true} {16926#true} #87#return; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L272 TraceCheckUtils]: 28: Hoare triple {16926#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 27: Hoare triple {16926#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16926#true} {16926#true} #85#return; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L272 TraceCheckUtils]: 22: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16926#true} {16926#true} #83#return; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L272 TraceCheckUtils]: 17: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {16926#true} {16926#true} #81#return; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L272 TraceCheckUtils]: 12: Hoare triple {16926#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {16926#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16926#true} {16926#true} #79#return; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {16926#true} assume !(0 == ~cond); {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {16926#true} ~cond := #in~cond; {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {16926#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {16926#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {16926#true} call #t~ret6 := main(); {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16926#true} {16926#true} #103#return; {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {16926#true} assume true; {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {16926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {16926#true} call ULTIMATE.init(); {16926#true} is VALID [2022-04-28 05:51:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-04-28 05:51:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984628072] [2022-04-28 05:51:24,649 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259970991] [2022-04-28 05:51:24,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259970991] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:24,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:24,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-28 05:51:24,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1235595525] [2022-04-28 05:51:24,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1235595525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:24,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:24,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 05:51:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767381991] [2022-04-28 05:51:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2022-04-28 05:51:24,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:24,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 05:51:24,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:24,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 05:51:24,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 05:51:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 05:51:24,688 INFO L87 Difference]: Start difference. First operand 221 states and 303 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 05:51:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:25,573 INFO L93 Difference]: Finished difference Result 235 states and 314 transitions. [2022-04-28 05:51:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 05:51:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2022-04-28 05:51:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 05:51:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 05:51:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 05:51:25,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-28 05:51:25,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-28 05:51:25,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:25,653 INFO L225 Difference]: With dead ends: 235 [2022-04-28 05:51:25,654 INFO L226 Difference]: Without dead ends: 232 [2022-04-28 05:51:25,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 05:51:25,654 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:25,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 156 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 05:51:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-28 05:51:26,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2022-04-28 05:51:26,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:26,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:51:26,262 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:51:26,262 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:51:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:26,270 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2022-04-28 05:51:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-04-28 05:51:26,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:26,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:26,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 232 states. [2022-04-28 05:51:26,271 INFO L87 Difference]: Start difference. First operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 232 states. [2022-04-28 05:51:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:26,275 INFO L93 Difference]: Finished difference Result 232 states and 310 transitions. [2022-04-28 05:51:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 310 transitions. [2022-04-28 05:51:26,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:26,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:26,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:26,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 125 states have internal predecessors, (141), 85 states have call successors, (85), 22 states have call predecessors, (85), 21 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:51:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 309 transitions. [2022-04-28 05:51:26,282 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 309 transitions. Word has length 122 [2022-04-28 05:51:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:26,282 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 309 transitions. [2022-04-28 05:51:26,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 05:51:26,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 231 states and 309 transitions. [2022-04-28 05:51:26,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 309 transitions. [2022-04-28 05:51:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 05:51:26,850 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:26,851 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:51:26,867 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 05:51:27,064 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 05:51:27,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:27,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash 541794983, now seen corresponding path program 5 times [2022-04-28 05:51:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:27,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2072624836] [2022-04-28 05:51:27,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash 541794983, now seen corresponding path program 6 times [2022-04-28 05:51:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:27,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579026838] [2022-04-28 05:51:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:27,076 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:27,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159769227] [2022-04-28 05:51:27,076 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 05:51:27,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:27,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:27,077 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 05:51:27,092 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 05:51:27,180 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 05:51:27,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:27,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 05:51:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:27,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:28,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {19068#true} call ULTIMATE.init(); {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {19068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19068#true} {19068#true} #103#return; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {19068#true} call #t~ret6 := main(); {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {19068#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L272 TraceCheckUtils]: 6: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19068#true} {19068#true} #79#return; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {19068#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L272 TraceCheckUtils]: 12: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19068#true} {19068#true} #81#return; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L272 TraceCheckUtils]: 17: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {19068#true} {19068#true} #83#return; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L272 TraceCheckUtils]: 22: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,009 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {19068#true} {19068#true} #85#return; {19068#true} is VALID [2022-04-28 05:51:28,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {19068#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,010 INFO L272 TraceCheckUtils]: 28: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,010 INFO L290 TraceCheckUtils]: 31: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,010 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19068#true} {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,010 INFO L272 TraceCheckUtils]: 33: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,011 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19068#true} {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {19154#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,012 INFO L272 TraceCheckUtils]: 41: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,013 INFO L272 TraceCheckUtils]: 46: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,013 INFO L272 TraceCheckUtils]: 51: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,014 INFO L290 TraceCheckUtils]: 54: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,014 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,014 INFO L272 TraceCheckUtils]: 56: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,014 INFO L290 TraceCheckUtils]: 58: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,015 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19068#true} {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,015 INFO L290 TraceCheckUtils]: 61: Hoare triple {19191#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {19258#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:28,015 INFO L290 TraceCheckUtils]: 62: Hoare triple {19258#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {19262#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-28 05:51:28,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !false; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-28 05:51:28,016 INFO L272 TraceCheckUtils]: 66: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,016 INFO L290 TraceCheckUtils]: 67: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,017 INFO L290 TraceCheckUtils]: 68: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,017 INFO L290 TraceCheckUtils]: 69: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,017 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #91#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-28 05:51:28,017 INFO L272 TraceCheckUtils]: 71: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,017 INFO L290 TraceCheckUtils]: 73: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,017 INFO L290 TraceCheckUtils]: 74: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,018 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #93#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-28 05:51:28,018 INFO L272 TraceCheckUtils]: 76: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,018 INFO L290 TraceCheckUtils]: 78: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,018 INFO L290 TraceCheckUtils]: 79: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,018 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #95#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-28 05:51:28,019 INFO L272 TraceCheckUtils]: 81: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,019 INFO L290 TraceCheckUtils]: 82: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,019 INFO L290 TraceCheckUtils]: 83: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,019 INFO L290 TraceCheckUtils]: 84: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,028 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19068#true} {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} #97#return; {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} is VALID [2022-04-28 05:51:28,028 INFO L290 TraceCheckUtils]: 86: Hoare triple {19269#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~q~0 1) (not (<= main_~c~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,043 INFO L290 TraceCheckUtils]: 87: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !false; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,043 INFO L272 TraceCheckUtils]: 88: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,043 INFO L290 TraceCheckUtils]: 89: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,043 INFO L290 TraceCheckUtils]: 90: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,043 INFO L290 TraceCheckUtils]: 91: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,044 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #91#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,044 INFO L272 TraceCheckUtils]: 93: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,044 INFO L290 TraceCheckUtils]: 94: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,044 INFO L290 TraceCheckUtils]: 95: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,044 INFO L290 TraceCheckUtils]: 96: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #93#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,045 INFO L272 TraceCheckUtils]: 98: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L290 TraceCheckUtils]: 99: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L290 TraceCheckUtils]: 100: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L290 TraceCheckUtils]: 101: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #95#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,045 INFO L272 TraceCheckUtils]: 103: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L290 TraceCheckUtils]: 104: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,045 INFO L290 TraceCheckUtils]: 105: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,046 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {19068#true} {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #97#return; {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {19336#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {19403#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (not (<= main_~y~0 (* main_~c~0 2))) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 1))} is VALID [2022-04-28 05:51:28,048 INFO L290 TraceCheckUtils]: 109: Hoare triple {19403#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (not (<= main_~y~0 (* main_~c~0 2))) (= main_~r~0 1) (= (+ (- 1) main_~k~0) 0) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 05:51:28,048 INFO L290 TraceCheckUtils]: 110: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 05:51:28,048 INFO L290 TraceCheckUtils]: 111: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 05:51:28,049 INFO L290 TraceCheckUtils]: 112: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} assume !false; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 05:51:28,049 INFO L272 TraceCheckUtils]: 113: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,049 INFO L290 TraceCheckUtils]: 114: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,049 INFO L290 TraceCheckUtils]: 115: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,049 INFO L290 TraceCheckUtils]: 116: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,049 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {19068#true} {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} #91#return; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 05:51:28,049 INFO L272 TraceCheckUtils]: 118: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:28,050 INFO L290 TraceCheckUtils]: 119: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:28,050 INFO L290 TraceCheckUtils]: 120: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:28,050 INFO L290 TraceCheckUtils]: 121: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:28,050 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19068#true} {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} #93#return; {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 05:51:28,051 INFO L272 TraceCheckUtils]: 123: Hoare triple {19407#(and (not (<= main_~y~0 main_~x~0)) (= main_~s~0 1) (not (<= (* main_~x~0 2) main_~y~0)) (= (+ (- 1) (* (- 1) main_~q~0)) 0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:28,051 INFO L290 TraceCheckUtils]: 124: Hoare triple {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:28,051 INFO L290 TraceCheckUtils]: 125: Hoare triple {19454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19069#false} is VALID [2022-04-28 05:51:28,051 INFO L290 TraceCheckUtils]: 126: Hoare triple {19069#false} assume !false; {19069#false} is VALID [2022-04-28 05:51:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 05:51:28,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:51:29,633 INFO L290 TraceCheckUtils]: 126: Hoare triple {19069#false} assume !false; {19069#false} is VALID [2022-04-28 05:51:29,633 INFO L290 TraceCheckUtils]: 125: Hoare triple {19454#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19069#false} is VALID [2022-04-28 05:51:29,633 INFO L290 TraceCheckUtils]: 124: Hoare triple {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:29,634 INFO L272 TraceCheckUtils]: 123: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:29,634 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19068#true} {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #93#return; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:29,634 INFO L290 TraceCheckUtils]: 121: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:29,634 INFO L290 TraceCheckUtils]: 120: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:29,634 INFO L290 TraceCheckUtils]: 119: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:29,635 INFO L272 TraceCheckUtils]: 118: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:29,635 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {19068#true} {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #91#return; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:29,635 INFO L290 TraceCheckUtils]: 116: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:29,635 INFO L290 TraceCheckUtils]: 115: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:29,635 INFO L290 TraceCheckUtils]: 114: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:29,635 INFO L272 TraceCheckUtils]: 113: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:29,635 INFO L290 TraceCheckUtils]: 112: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:29,636 INFO L290 TraceCheckUtils]: 111: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:29,636 INFO L290 TraceCheckUtils]: 110: Hoare triple {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !false; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-28 05:51:31,638 WARN L290 TraceCheckUtils]: 109: Hoare triple {19513#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19470#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-28 05:51:31,638 INFO L290 TraceCheckUtils]: 108: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {19513#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-28 05:51:31,639 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #97#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:31,639 INFO L290 TraceCheckUtils]: 106: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,639 INFO L290 TraceCheckUtils]: 105: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,639 INFO L290 TraceCheckUtils]: 104: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,639 INFO L272 TraceCheckUtils]: 103: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,640 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #95#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:31,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,640 INFO L290 TraceCheckUtils]: 100: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,640 INFO L290 TraceCheckUtils]: 99: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,640 INFO L272 TraceCheckUtils]: 98: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,641 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #93#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:31,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,641 INFO L290 TraceCheckUtils]: 95: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,641 INFO L290 TraceCheckUtils]: 94: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,641 INFO L272 TraceCheckUtils]: 93: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,641 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {19068#true} {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} #91#return; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:31,641 INFO L290 TraceCheckUtils]: 91: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,642 INFO L290 TraceCheckUtils]: 90: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,642 INFO L290 TraceCheckUtils]: 89: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,642 INFO L272 TraceCheckUtils]: 88: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,642 INFO L290 TraceCheckUtils]: 87: Hoare triple {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} assume !false; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:31,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {19517#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:31,970 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #97#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:51:31,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L290 TraceCheckUtils]: 83: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L290 TraceCheckUtils]: 82: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L272 TraceCheckUtils]: 81: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #95#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:51:31,971 INFO L290 TraceCheckUtils]: 79: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L290 TraceCheckUtils]: 78: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L290 TraceCheckUtils]: 77: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,971 INFO L272 TraceCheckUtils]: 76: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,972 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #93#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:51:31,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,972 INFO L290 TraceCheckUtils]: 72: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,972 INFO L272 TraceCheckUtils]: 71: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,973 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {19068#true} {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} #91#return; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:51:31,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:31,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:31,973 INFO L290 TraceCheckUtils]: 67: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:31,973 INFO L272 TraceCheckUtils]: 66: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:31,974 INFO L290 TraceCheckUtils]: 65: Hoare triple {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} assume !false; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:51:31,974 INFO L290 TraceCheckUtils]: 64: Hoare triple {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19584#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))))} is VALID [2022-04-28 05:51:31,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 05:51:32,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {19658#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {19651#(or (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 05:51:32,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} assume !(~c~0 >= ~b~0); {19658#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)))} is VALID [2022-04-28 05:51:32,056 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #97#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:32,056 INFO L290 TraceCheckUtils]: 59: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,056 INFO L272 TraceCheckUtils]: 56: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,057 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #95#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:32,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,057 INFO L272 TraceCheckUtils]: 51: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,058 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #93#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:32,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,058 INFO L272 TraceCheckUtils]: 46: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,060 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19068#true} {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} #91#return; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:32,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,060 INFO L272 TraceCheckUtils]: 41: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} assume !false; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:32,061 INFO L290 TraceCheckUtils]: 39: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {19662#(or (<= (* main_~c~0 2) main_~b~0) (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* (- 1) main_~c~0) main_~b~0)) (<= main_~b~0 main_~c~0))} is VALID [2022-04-28 05:51:32,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} assume !false; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:51:32,062 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {19068#true} {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #89#return; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:51:32,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,062 INFO L272 TraceCheckUtils]: 33: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,063 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19068#true} {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} #87#return; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:51:32,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,063 INFO L272 TraceCheckUtils]: 28: Hoare triple {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {19068#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {19729#(or (<= main_~b~0 main_~a~0) (<= (* main_~a~0 2) main_~b~0) (= (+ (* (+ main_~s~0 (* (- 1) main_~r~0)) main_~y~0) (* main_~x~0 (+ main_~q~0 (* (- 1) main_~p~0)))) (+ (* (- 1) main_~a~0) main_~b~0)))} is VALID [2022-04-28 05:51:32,064 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {19068#true} {19068#true} #85#return; {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L272 TraceCheckUtils]: 22: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {19068#true} {19068#true} #83#return; {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L272 TraceCheckUtils]: 17: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,064 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19068#true} {19068#true} #81#return; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L272 TraceCheckUtils]: 12: Hoare triple {19068#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {19068#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19068#true} {19068#true} #79#return; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {19068#true} assume !(0 == ~cond); {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {19068#true} ~cond := #in~cond; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {19068#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {19068#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {19068#true} call #t~ret6 := main(); {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19068#true} {19068#true} #103#return; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {19068#true} assume true; {19068#true} is VALID [2022-04-28 05:51:32,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {19068#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19068#true} is VALID [2022-04-28 05:51:32,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {19068#true} call ULTIMATE.init(); {19068#true} is VALID [2022-04-28 05:51:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 36 proven. 29 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 05:51:32,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:51:32,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579026838] [2022-04-28 05:51:32,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:51:32,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159769227] [2022-04-28 05:51:32,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159769227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:51:32,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:51:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2022-04-28 05:51:32,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:51:32,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2072624836] [2022-04-28 05:51:32,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2072624836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:51:32,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:51:32,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 05:51:32,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265958705] [2022-04-28 05:51:32,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:51:32,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 127 [2022-04-28 05:51:32,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:51:32,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:51:32,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:32,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 05:51:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:32,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 05:51:32,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-28 05:51:32,147 INFO L87 Difference]: Start difference. First operand 231 states and 309 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:51:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:35,411 INFO L93 Difference]: Finished difference Result 269 states and 358 transitions. [2022-04-28 05:51:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 05:51:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 127 [2022-04-28 05:51:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:51:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:51:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-04-28 05:51:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:51:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2022-04-28 05:51:35,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 125 transitions. [2022-04-28 05:51:35,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:35,555 INFO L225 Difference]: With dead ends: 269 [2022-04-28 05:51:35,556 INFO L226 Difference]: Without dead ends: 267 [2022-04-28 05:51:35,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2022-04-28 05:51:35,556 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 05:51:35,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 378 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 05:51:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-28 05:51:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 264. [2022-04-28 05:51:36,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:51:36,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 05:51:36,223 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 05:51:36,223 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 05:51:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:36,230 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2022-04-28 05:51:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2022-04-28 05:51:36,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:36,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:36,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand 267 states. [2022-04-28 05:51:36,231 INFO L87 Difference]: Start difference. First operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) Second operand 267 states. [2022-04-28 05:51:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:51:36,238 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2022-04-28 05:51:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 356 transitions. [2022-04-28 05:51:36,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:51:36,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:51:36,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:51:36,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:51:36,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 142 states have (on average 1.1338028169014085) internal successors, (161), 143 states have internal predecessors, (161), 97 states have call successors, (97), 25 states have call predecessors, (97), 24 states have return successors, (95), 95 states have call predecessors, (95), 95 states have call successors, (95) [2022-04-28 05:51:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 353 transitions. [2022-04-28 05:51:36,245 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 353 transitions. Word has length 127 [2022-04-28 05:51:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:51:36,245 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 353 transitions. [2022-04-28 05:51:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-28 05:51:36,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 353 transitions. [2022-04-28 05:51:36,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:51:36,994 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 353 transitions. [2022-04-28 05:51:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-28 05:51:36,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:51:36,995 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:51:37,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 05:51:37,195 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 05:51:37,196 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:51:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:51:37,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2138166692, now seen corresponding path program 7 times [2022-04-28 05:51:37,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:51:37,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [16604585] [2022-04-28 05:51:37,196 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:51:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2138166692, now seen corresponding path program 8 times [2022-04-28 05:51:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:51:37,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750541871] [2022-04-28 05:51:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:51:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:51:37,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:51:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809504216] [2022-04-28 05:51:37,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:51:37,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:51:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:51:37,228 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 05:51:37,243 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 05:51:37,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:51:37,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:51:37,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 05:51:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:51:37,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:51:41,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {21461#true} call ULTIMATE.init(); {21461#true} is VALID [2022-04-28 05:51:41,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {21461#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21461#true} is VALID [2022-04-28 05:51:41,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21461#true} {21461#true} #103#return; {21461#true} is VALID [2022-04-28 05:51:41,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {21461#true} call #t~ret6 := main(); {21461#true} is VALID [2022-04-28 05:51:41,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {21461#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {21461#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21461#true} {21461#true} #79#return; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {21461#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L272 TraceCheckUtils]: 12: Hoare triple {21461#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21461#true} {21461#true} #81#return; {21461#true} is VALID [2022-04-28 05:51:41,365 INFO L272 TraceCheckUtils]: 17: Hoare triple {21461#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {21461#true} ~cond := #in~cond; {21520#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:51:41,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {21520#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {21524#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:51:41,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {21524#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {21524#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:51:41,367 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {21524#(not (= |assume_abort_if_not_#in~cond| 0))} {21461#true} #83#return; {21531#(<= 1 main_~x~0)} is VALID [2022-04-28 05:51:41,367 INFO L272 TraceCheckUtils]: 22: Hoare triple {21531#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,367 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21461#true} {21531#(<= 1 main_~x~0)} #85#return; {21531#(<= 1 main_~x~0)} is VALID [2022-04-28 05:51:41,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {21531#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,368 INFO L272 TraceCheckUtils]: 28: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,369 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21461#true} {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,369 INFO L272 TraceCheckUtils]: 33: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,370 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {21461#true} {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {21550#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,371 INFO L272 TraceCheckUtils]: 41: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,372 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,372 INFO L272 TraceCheckUtils]: 46: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,373 INFO L290 TraceCheckUtils]: 49: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,373 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,373 INFO L272 TraceCheckUtils]: 51: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,374 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,374 INFO L272 TraceCheckUtils]: 56: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,375 INFO L290 TraceCheckUtils]: 59: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,376 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {21461#true} {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,377 INFO L290 TraceCheckUtils]: 61: Hoare triple {21587#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,378 INFO L272 TraceCheckUtils]: 63: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:41,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,379 INFO L290 TraceCheckUtils]: 66: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,380 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,380 INFO L272 TraceCheckUtils]: 68: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,380 INFO L290 TraceCheckUtils]: 71: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,381 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21461#true} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,381 INFO L272 TraceCheckUtils]: 73: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,381 INFO L290 TraceCheckUtils]: 74: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,381 INFO L290 TraceCheckUtils]: 75: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,381 INFO L290 TraceCheckUtils]: 76: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,382 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21461#true} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,382 INFO L272 TraceCheckUtils]: 78: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,382 INFO L290 TraceCheckUtils]: 79: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,382 INFO L290 TraceCheckUtils]: 80: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,382 INFO L290 TraceCheckUtils]: 81: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,383 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21461#true} {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {21654#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} assume !false; {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,385 INFO L272 TraceCheckUtils]: 85: Hoare triple {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,385 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {21461#true} {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} #91#return; {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,386 INFO L272 TraceCheckUtils]: 90: Hoare triple {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:41,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,388 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21723#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (<= (* main_~b~0 2) main_~a~0) (= main_~p~0 1))} #93#return; {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,388 INFO L272 TraceCheckUtils]: 95: Hoare triple {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,388 INFO L290 TraceCheckUtils]: 96: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:41,389 INFO L290 TraceCheckUtils]: 97: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,389 INFO L290 TraceCheckUtils]: 98: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,390 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} #95#return; {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,390 INFO L272 TraceCheckUtils]: 100: Hoare triple {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,390 INFO L290 TraceCheckUtils]: 101: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:41,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,391 INFO L290 TraceCheckUtils]: 103: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,391 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} #97#return; {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,392 INFO L290 TraceCheckUtils]: 105: Hoare triple {21757#(and (= main_~r~0 0) (<= 1 main_~x~0) (<= (* main_~b~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {21791#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 2))) (<= (* main_~y~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} is VALID [2022-04-28 05:51:41,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {21791#(and (= main_~r~0 0) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~y~0 2))) (<= (* main_~y~0 2) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,395 INFO L290 TraceCheckUtils]: 107: Hoare triple {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,395 INFO L290 TraceCheckUtils]: 108: Hoare triple {21795#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,396 INFO L290 TraceCheckUtils]: 109: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,396 INFO L272 TraceCheckUtils]: 110: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,396 INFO L290 TraceCheckUtils]: 111: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,396 INFO L290 TraceCheckUtils]: 112: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,396 INFO L290 TraceCheckUtils]: 113: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,397 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {21461#true} {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,397 INFO L272 TraceCheckUtils]: 115: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,397 INFO L290 TraceCheckUtils]: 116: Hoare triple {21461#true} ~cond := #in~cond; {21461#true} is VALID [2022-04-28 05:51:41,397 INFO L290 TraceCheckUtils]: 117: Hoare triple {21461#true} assume !(0 == ~cond); {21461#true} is VALID [2022-04-28 05:51:41,397 INFO L290 TraceCheckUtils]: 118: Hoare triple {21461#true} assume true; {21461#true} is VALID [2022-04-28 05:51:41,397 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {21461#true} {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,398 INFO L272 TraceCheckUtils]: 120: Hoare triple {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {21461#true} is VALID [2022-04-28 05:51:41,398 INFO L290 TraceCheckUtils]: 121: Hoare triple {21461#true} ~cond := #in~cond; {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:41,398 INFO L290 TraceCheckUtils]: 122: Hoare triple {21664#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,398 INFO L290 TraceCheckUtils]: 123: Hoare triple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:51:41,399 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {21668#(not (= |__VERIFIER_assert_#in~cond| 0))} {21802#(and (<= (* main_~y~0 2) main_~x~0) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {21851#(and (<= (* main_~y~0 2) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:51:41,402 INFO L272 TraceCheckUtils]: 125: Hoare triple {21851#(and (<= (* main_~y~0 2) main_~x~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (< main_~x~0 (* main_~y~0 3)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~b~0 (+ main_~x~0 (* (- 2) main_~y~0))) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {21855#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:51:41,402 INFO L290 TraceCheckUtils]: 126: Hoare triple {21855#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21859#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:51:41,403 INFO L290 TraceCheckUtils]: 127: Hoare triple {21859#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21462#false} is VALID [2022-04-28 05:51:41,403 INFO L290 TraceCheckUtils]: 128: Hoare triple {21462#false} assume !false; {21462#false} is VALID [2022-04-28 05:51:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 145 proven. 85 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-28 05:51:41,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:52:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:52:35,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750541871] [2022-04-28 05:52:35,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:52:35,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809504216] [2022-04-28 05:52:35,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809504216] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:52:35,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:52:35,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2022-04-28 05:52:35,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:52:35,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [16604585] [2022-04-28 05:52:35,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [16604585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:52:35,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:52:35,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 05:52:35,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790113515] [2022-04-28 05:52:35,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:52:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 129 [2022-04-28 05:52:35,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:52:35,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 05:52:35,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:52:35,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 05:52:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 05:52:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=475, Unknown=1, NotChecked=0, Total=600 [2022-04-28 05:52:35,231 INFO L87 Difference]: Start difference. First operand 264 states and 353 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 05:52:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:41,284 INFO L93 Difference]: Finished difference Result 272 states and 360 transitions. [2022-04-28 05:52:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:52:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 129 [2022-04-28 05:52:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:52:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 05:52:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-04-28 05:52:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 05:52:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 120 transitions. [2022-04-28 05:52:41,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 120 transitions. [2022-04-28 05:52:41,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:52:41,491 INFO L225 Difference]: With dead ends: 272 [2022-04-28 05:52:41,491 INFO L226 Difference]: Without dead ends: 270 [2022-04-28 05:52:41,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=154, Invalid=657, Unknown=1, NotChecked=0, Total=812 [2022-04-28 05:52:41,492 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 05:52:41,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 218 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 05:52:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-04-28 05:52:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 235. [2022-04-28 05:52:42,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:52:42,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:52:42,077 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:52:42,077 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:52:42,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:42,082 INFO L93 Difference]: Finished difference Result 270 states and 358 transitions. [2022-04-28 05:52:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 358 transitions. [2022-04-28 05:52:42,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:42,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:42,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 270 states. [2022-04-28 05:52:42,084 INFO L87 Difference]: Start difference. First operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 270 states. [2022-04-28 05:52:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:52:42,088 INFO L93 Difference]: Finished difference Result 270 states and 358 transitions. [2022-04-28 05:52:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 358 transitions. [2022-04-28 05:52:42,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:52:42,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:52:42,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:52:42,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:52:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 128 states have internal predecessors, (144), 85 states have call successors, (85), 23 states have call predecessors, (85), 22 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:52:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 312 transitions. [2022-04-28 05:52:42,094 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 312 transitions. Word has length 129 [2022-04-28 05:52:42,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:52:42,094 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 312 transitions. [2022-04-28 05:52:42,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 14 states have internal predecessors, (32), 9 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2022-04-28 05:52:42,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 235 states and 312 transitions. [2022-04-28 05:52:42,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:52:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 312 transitions. [2022-04-28 05:52:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-28 05:52:42,779 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:52:42,779 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:52:42,796 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 05:52:42,979 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 05:52:42,980 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:52:42,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:52:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875875, now seen corresponding path program 9 times [2022-04-28 05:52:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:52:42,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273593107] [2022-04-28 05:52:42,980 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:52:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1899875875, now seen corresponding path program 10 times [2022-04-28 05:52:42,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:52:42,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232426740] [2022-04-28 05:52:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:52:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:52:42,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:52:42,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679539396] [2022-04-28 05:52:42,998 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:52:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:52:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:52:43,001 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 05:52:43,009 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 05:52:43,082 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:52:43,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:52:43,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 05:52:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:52:43,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:52:44,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {23509#true} call ULTIMATE.init(); {23509#true} is VALID [2022-04-28 05:52:44,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {23509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23509#true} is VALID [2022-04-28 05:52:44,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23509#true} {23509#true} #103#return; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {23509#true} call #t~ret6 := main(); {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {23509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {23509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23509#true} {23509#true} #79#return; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {23509#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {23509#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23509#true} {23509#true} #81#return; {23509#true} is VALID [2022-04-28 05:52:44,866 INFO L272 TraceCheckUtils]: 17: Hoare triple {23509#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {23509#true} ~cond := #in~cond; {23568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:52:44,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {23568#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {23572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:52:44,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {23572#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {23572#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:52:44,868 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23572#(not (= |assume_abort_if_not_#in~cond| 0))} {23509#true} #83#return; {23579#(<= 1 main_~x~0)} is VALID [2022-04-28 05:52:44,868 INFO L272 TraceCheckUtils]: 22: Hoare triple {23579#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,868 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23509#true} {23579#(<= 1 main_~x~0)} #85#return; {23579#(<= 1 main_~x~0)} is VALID [2022-04-28 05:52:44,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {23579#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,869 INFO L272 TraceCheckUtils]: 28: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,869 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23509#true} {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,869 INFO L272 TraceCheckUtils]: 33: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,870 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23509#true} {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {23598#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !false; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,871 INFO L272 TraceCheckUtils]: 41: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,885 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23509#true} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #91#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,885 INFO L272 TraceCheckUtils]: 46: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,886 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23509#true} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #93#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,886 INFO L272 TraceCheckUtils]: 51: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:44,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,887 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #95#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,887 INFO L272 TraceCheckUtils]: 56: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:44,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,888 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #97#return; {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,888 INFO L290 TraceCheckUtils]: 61: Hoare triple {23635#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {23704#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:52:44,889 INFO L290 TraceCheckUtils]: 62: Hoare triple {23704#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,889 INFO L290 TraceCheckUtils]: 63: Hoare triple {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {23708#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,890 INFO L272 TraceCheckUtils]: 66: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L290 TraceCheckUtils]: 68: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,891 INFO L272 TraceCheckUtils]: 71: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L290 TraceCheckUtils]: 72: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L290 TraceCheckUtils]: 73: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,892 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,892 INFO L272 TraceCheckUtils]: 76: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,892 INFO L290 TraceCheckUtils]: 77: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,892 INFO L290 TraceCheckUtils]: 78: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,892 INFO L290 TraceCheckUtils]: 79: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,893 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,893 INFO L272 TraceCheckUtils]: 81: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,893 INFO L290 TraceCheckUtils]: 82: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,893 INFO L290 TraceCheckUtils]: 83: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,893 INFO L290 TraceCheckUtils]: 84: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,893 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {23509#true} {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,894 INFO L290 TraceCheckUtils]: 86: Hoare triple {23715#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,894 INFO L290 TraceCheckUtils]: 87: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,894 INFO L272 TraceCheckUtils]: 88: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,894 INFO L290 TraceCheckUtils]: 89: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,894 INFO L290 TraceCheckUtils]: 90: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,894 INFO L290 TraceCheckUtils]: 91: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,895 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {23509#true} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,895 INFO L272 TraceCheckUtils]: 93: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,895 INFO L290 TraceCheckUtils]: 94: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,895 INFO L290 TraceCheckUtils]: 95: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,895 INFO L290 TraceCheckUtils]: 96: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,895 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23509#true} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,896 INFO L272 TraceCheckUtils]: 98: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,896 INFO L290 TraceCheckUtils]: 99: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:44,896 INFO L290 TraceCheckUtils]: 100: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,896 INFO L290 TraceCheckUtils]: 101: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,896 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,897 INFO L272 TraceCheckUtils]: 103: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,897 INFO L290 TraceCheckUtils]: 104: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:44,897 INFO L290 TraceCheckUtils]: 105: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,897 INFO L290 TraceCheckUtils]: 106: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,898 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #97#return; {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,899 INFO L290 TraceCheckUtils]: 108: Hoare triple {23782#(and (= (+ main_~y~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {23849#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< (* main_~c~0 2) main_~y~0))} is VALID [2022-04-28 05:52:44,901 INFO L290 TraceCheckUtils]: 109: Hoare triple {23849#(and (= (+ main_~c~0 main_~x~0) main_~y~0) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< (* main_~c~0 2) main_~y~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,901 INFO L290 TraceCheckUtils]: 110: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,902 INFO L290 TraceCheckUtils]: 111: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,902 INFO L290 TraceCheckUtils]: 112: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !false; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,902 INFO L272 TraceCheckUtils]: 113: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,902 INFO L290 TraceCheckUtils]: 114: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,902 INFO L290 TraceCheckUtils]: 115: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,902 INFO L290 TraceCheckUtils]: 116: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,903 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23509#true} {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #91#return; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,903 INFO L272 TraceCheckUtils]: 118: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,903 INFO L290 TraceCheckUtils]: 119: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:52:44,903 INFO L290 TraceCheckUtils]: 120: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:52:44,903 INFO L290 TraceCheckUtils]: 121: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:52:44,903 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23509#true} {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #93#return; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,904 INFO L272 TraceCheckUtils]: 123: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:52:44,904 INFO L290 TraceCheckUtils]: 124: Hoare triple {23509#true} ~cond := #in~cond; {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:44,904 INFO L290 TraceCheckUtils]: 125: Hoare triple {23675#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,904 INFO L290 TraceCheckUtils]: 126: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:52:44,904 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #95#return; {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 05:52:44,906 INFO L272 TraceCheckUtils]: 128: Hoare triple {23853#(and (< main_~y~0 (* main_~x~0 2)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= main_~b~0 (+ main_~y~0 (* (- 1) main_~x~0))) (= (* (- 1) main_~q~0) 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:52:44,906 INFO L290 TraceCheckUtils]: 129: Hoare triple {23911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:52:44,907 INFO L290 TraceCheckUtils]: 130: Hoare triple {23915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23510#false} is VALID [2022-04-28 05:52:44,907 INFO L290 TraceCheckUtils]: 131: Hoare triple {23510#false} assume !false; {23510#false} is VALID [2022-04-28 05:52:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 121 proven. 114 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-04-28 05:52:44,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:54:50,717 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_main_~s~0 c_main_~k~0)) (.cse8 (* (- 1) c_main_~q~0 c_main_~k~0))) (let ((.cse11 (* (- 1) c_main_~q~0 c_main_~x~0 c_main_~k~0)) (.cse13 (* (- 1) c_main_~s~0 c_main_~y~0)) (.cse14 (* (- 1) c_main_~s~0 c_main_~y~0 c_main_~k~0)) (.cse1 (* c_main_~p~0 c_main_~x~0)) (.cse0 (* c_main_~r~0 c_main_~y~0)) (.cse15 (* (- 1) c_main_~q~0 c_main_~x~0)) (.cse12 (+ c_main_~p~0 .cse8)) (.cse16 (+ c_main_~r~0 (* (- 1) .cse7)))) (let ((.cse9 (* .cse16 c_main_~y~0)) (.cse10 (* .cse12 c_main_~x~0)) (.cse2 (+ c_main_~b~0 .cse11 .cse13 .cse14 .cse1 .cse0 .cse15))) (or (<= (+ c_main_~b~0 (* 2 .cse0) (* 2 .cse1)) (+ (* (* c_main_~q~0 c_main_~x~0) 2) (* 2 (* c_main_~s~0 c_main_~y~0)) (* 2 (* c_main_~q~0 c_main_~x~0 c_main_~k~0)) (* 2 (* c_main_~s~0 c_main_~y~0 c_main_~k~0)))) (not (= c_main_~c~0 .cse2)) (let ((.cse4 (+ c_main_~q~0 (* (- 1) c_main_~p~0) (* (- 1) .cse8))) (.cse6 (+ c_main_~s~0 .cse7 (* (- 1) c_main_~r~0)))) (let ((.cse3 (* .cse6 c_main_~y~0)) (.cse5 (* .cse4 c_main_~x~0))) (= (+ .cse3 (* .cse4 c_main_~xy~0) .cse5 (* c_main_~yy~0 .cse6)) (+ (* (+ .cse3 .cse5) c_main_~y~0) .cse3 .cse5)))) (not (= (+ .cse9 .cse10) .cse2)) (<= c_main_~b~0 c_main_~c~0) (not (= (+ c_main_~b~0 .cse11 (* c_main_~xy~0 .cse12) .cse13 .cse14 .cse1 .cse0 .cse15 (* c_main_~yy~0 .cse16)) (+ .cse9 .cse10 (* .cse2 c_main_~y~0)))))))) is different from true [2022-04-28 05:55:43,991 INFO L290 TraceCheckUtils]: 131: Hoare triple {23510#false} assume !false; {23510#false} is VALID [2022-04-28 05:55:43,992 INFO L290 TraceCheckUtils]: 130: Hoare triple {23915#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {23510#false} is VALID [2022-04-28 05:55:43,992 INFO L290 TraceCheckUtils]: 129: Hoare triple {23911#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23915#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:43,992 INFO L272 TraceCheckUtils]: 128: Hoare triple {23931#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23911#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:43,993 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #95#return; {23931#(= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))} is VALID [2022-04-28 05:55:43,993 INFO L290 TraceCheckUtils]: 126: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:43,993 INFO L290 TraceCheckUtils]: 125: Hoare triple {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:43,994 INFO L290 TraceCheckUtils]: 124: Hoare triple {23509#true} ~cond := #in~cond; {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:55:43,997 INFO L272 TraceCheckUtils]: 123: Hoare triple {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:43,997 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23509#true} {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #93#return; {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:43,997 INFO L290 TraceCheckUtils]: 121: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:43,997 INFO L290 TraceCheckUtils]: 120: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:43,997 INFO L290 TraceCheckUtils]: 119: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:43,997 INFO L272 TraceCheckUtils]: 118: Hoare triple {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:43,998 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23509#true} {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #91#return; {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:43,998 INFO L290 TraceCheckUtils]: 116: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:43,998 INFO L290 TraceCheckUtils]: 115: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:43,998 INFO L290 TraceCheckUtils]: 114: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:43,998 INFO L272 TraceCheckUtils]: 113: Hoare triple {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:43,998 INFO L290 TraceCheckUtils]: 112: Hoare triple {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:43,999 INFO L290 TraceCheckUtils]: 111: Hoare triple {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:43,999 INFO L290 TraceCheckUtils]: 110: Hoare triple {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,002 WARN L290 TraceCheckUtils]: 109: Hoare triple {23991#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23935#(or (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is UNKNOWN [2022-04-28 05:55:46,003 INFO L290 TraceCheckUtils]: 108: Hoare triple {23995#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !(~c~0 >= ~b~0); {23991#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,004 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23999#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #97#return; {23995#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,007 INFO L290 TraceCheckUtils]: 106: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:46,008 INFO L290 TraceCheckUtils]: 105: Hoare triple {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:46,008 INFO L290 TraceCheckUtils]: 104: Hoare triple {23509#true} ~cond := #in~cond; {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:55:46,008 INFO L272 TraceCheckUtils]: 103: Hoare triple {23999#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,009 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #95#return; {23999#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,010 INFO L290 TraceCheckUtils]: 101: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:46,010 INFO L290 TraceCheckUtils]: 100: Hoare triple {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:46,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {23509#true} ~cond := #in~cond; {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:55:46,011 INFO L272 TraceCheckUtils]: 98: Hoare triple {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,012 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {23509#true} {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #93#return; {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,012 INFO L290 TraceCheckUtils]: 96: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:46,012 INFO L290 TraceCheckUtils]: 95: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:46,012 INFO L290 TraceCheckUtils]: 94: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:46,012 INFO L272 TraceCheckUtils]: 93: Hoare triple {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,013 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {23509#true} {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} #91#return; {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,013 INFO L290 TraceCheckUtils]: 91: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:46,013 INFO L290 TraceCheckUtils]: 90: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:46,013 INFO L290 TraceCheckUtils]: 89: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:46,013 INFO L272 TraceCheckUtils]: 88: Hoare triple {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,014 INFO L290 TraceCheckUtils]: 87: Hoare triple {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} assume !false; {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24015#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~y~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)))} is VALID [2022-04-28 05:55:46,496 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {23509#true} {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #97#return; {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,496 INFO L290 TraceCheckUtils]: 84: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:46,496 INFO L290 TraceCheckUtils]: 83: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:46,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:46,497 INFO L272 TraceCheckUtils]: 81: Hoare triple {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,497 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23509#true} {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #95#return; {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:46,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:46,498 INFO L290 TraceCheckUtils]: 77: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:46,498 INFO L272 TraceCheckUtils]: 76: Hoare triple {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,498 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {23509#true} {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #93#return; {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,498 INFO L290 TraceCheckUtils]: 74: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:46,499 INFO L290 TraceCheckUtils]: 73: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:46,499 INFO L290 TraceCheckUtils]: 72: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:46,499 INFO L272 TraceCheckUtils]: 71: Hoare triple {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,500 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {23509#true} {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #91#return; {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:46,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:46,500 INFO L290 TraceCheckUtils]: 67: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:46,500 INFO L272 TraceCheckUtils]: 66: Hoare triple {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:46,501 INFO L290 TraceCheckUtils]: 65: Hoare triple {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !false; {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {24131#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))) (<= (* main_~b~0 2) main_~a~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24064#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))) (* (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) main_~y~0)) (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0)) main_~xy~0) (* (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))) main_~yy~0) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1)))))) (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-28 05:55:46,502 INFO L290 TraceCheckUtils]: 63: Hoare triple {24131#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))) (<= (* main_~b~0 2) main_~a~0))} assume !false; {24131#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))) (<= (* main_~b~0 2) main_~a~0))} is VALID [2022-04-28 05:55:48,505 WARN L290 TraceCheckUtils]: 62: Hoare triple {24138#(or (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (<= (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) (* 2 (* main_~q~0 main_~k~0 main_~x~0)) (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0))) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {24131#(or (not (= (+ (* main_~b~0 main_~y~0) (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~s~0 main_~yy~0) main_~b~0 (* main_~q~0 main_~xy~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) main_~y~0))) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))) (<= (* main_~b~0 2) main_~a~0))} is UNKNOWN [2022-04-28 05:55:48,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {24142#(or (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (<= (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) (* 2 (* main_~q~0 main_~k~0 main_~x~0)) (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0))) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)))))} assume !(~c~0 >= ~b~0); {24138#(or (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (<= (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) (* 2 (* main_~q~0 main_~k~0 main_~x~0)) (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0))) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)))))} is VALID [2022-04-28 05:55:48,508 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} {23509#true} #97#return; {24142#(or (= (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~yy~0) (* main_~xy~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))) (<= (+ main_~b~0 (* (* main_~y~0 main_~r~0) 2) (* 2 (* main_~p~0 main_~x~0))) (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2) (* 2 (* main_~q~0 main_~k~0 main_~x~0)) (* (* main_~k~0 main_~y~0 main_~s~0) 2))) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (not (= main_~c~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0)))) (<= main_~b~0 main_~c~0) (not (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0))) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* (- 1) main_~y~0 main_~s~0) (* (- 1) main_~k~0 main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~yy~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* (- 1) main_~q~0 main_~k~0 main_~x~0) (* main_~p~0 main_~x~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~xy~0)))))} is VALID [2022-04-28 05:55:48,509 INFO L290 TraceCheckUtils]: 59: Hoare triple {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:48,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {23679#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:48,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {23509#true} ~cond := #in~cond; {23945#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 05:55:48,509 INFO L272 TraceCheckUtils]: 56: Hoare triple {23509#true} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,509 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {23509#true} {23509#true} #95#return; {23509#true} is VALID [2022-04-28 05:55:48,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L272 TraceCheckUtils]: 51: Hoare triple {23509#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23509#true} {23509#true} #93#return; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 49: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 48: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L272 TraceCheckUtils]: 46: Hoare triple {23509#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {23509#true} {23509#true} #91#return; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L272 TraceCheckUtils]: 41: Hoare triple {23509#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {23509#true} assume !false; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {23509#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {23509#true} is VALID [2022-04-28 05:55:48,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {23509#true} assume !false; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {23509#true} {23509#true} #89#return; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L272 TraceCheckUtils]: 33: Hoare triple {23509#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23509#true} {23509#true} #87#return; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L272 TraceCheckUtils]: 28: Hoare triple {23509#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {23509#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23509#true} {23509#true} #85#return; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L272 TraceCheckUtils]: 22: Hoare triple {23509#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {23509#true} {23509#true} #83#return; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L272 TraceCheckUtils]: 17: Hoare triple {23509#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23509#true} {23509#true} #81#return; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L272 TraceCheckUtils]: 12: Hoare triple {23509#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {23509#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23509#true} {23509#true} #79#return; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {23509#true} assume !(0 == ~cond); {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {23509#true} ~cond := #in~cond; {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L272 TraceCheckUtils]: 6: Hoare triple {23509#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {23509#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {23509#true} call #t~ret6 := main(); {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23509#true} {23509#true} #103#return; {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {23509#true} assume true; {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {23509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23509#true} is VALID [2022-04-28 05:55:48,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {23509#true} call ULTIMATE.init(); {23509#true} is VALID [2022-04-28 05:55:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 141 proven. 59 refuted. 0 times theorem prover too weak. 348 trivial. 2 not checked. [2022-04-28 05:55:48,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:55:48,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232426740] [2022-04-28 05:55:48,514 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:55:48,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679539396] [2022-04-28 05:55:48,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679539396] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 05:55:48,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 05:55:48,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2022-04-28 05:55:48,514 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:55:48,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273593107] [2022-04-28 05:55:48,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273593107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:55:48,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:55:48,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 05:55:48,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573921219] [2022-04-28 05:55:48,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:55:48,515 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 132 [2022-04-28 05:55:48,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:55:48,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-28 05:55:48,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 05:55:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 05:55:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=558, Unknown=1, NotChecked=50, Total=756 [2022-04-28 05:55:48,611 INFO L87 Difference]: Start difference. First operand 235 states and 312 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-28 05:55:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:56,047 INFO L93 Difference]: Finished difference Result 244 states and 320 transitions. [2022-04-28 05:55:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 05:55:56,047 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 132 [2022-04-28 05:55:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:55:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-28 05:55:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 125 transitions. [2022-04-28 05:55:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-28 05:55:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 125 transitions. [2022-04-28 05:55:56,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 125 transitions. [2022-04-28 05:55:56,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:56,256 INFO L225 Difference]: With dead ends: 244 [2022-04-28 05:55:56,256 INFO L226 Difference]: Without dead ends: 242 [2022-04-28 05:55:56,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=238, Invalid=955, Unknown=1, NotChecked=66, Total=1260 [2022-04-28 05:55:56,260 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 05:55:56,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 282 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 05:55:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-04-28 05:55:56,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2022-04-28 05:55:56,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:55:56,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand has 239 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 131 states have internal predecessors, (147), 85 states have call successors, (85), 24 states have call predecessors, (85), 23 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:55:56,823 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand has 239 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 131 states have internal predecessors, (147), 85 states have call successors, (85), 24 states have call predecessors, (85), 23 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:55:56,823 INFO L87 Difference]: Start difference. First operand 242 states. Second operand has 239 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 131 states have internal predecessors, (147), 85 states have call successors, (85), 24 states have call predecessors, (85), 23 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:55:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:56,827 INFO L93 Difference]: Finished difference Result 242 states and 318 transitions. [2022-04-28 05:55:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 318 transitions. [2022-04-28 05:55:56,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:56,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:56,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 131 states have internal predecessors, (147), 85 states have call successors, (85), 24 states have call predecessors, (85), 23 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 242 states. [2022-04-28 05:55:56,829 INFO L87 Difference]: Start difference. First operand has 239 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 131 states have internal predecessors, (147), 85 states have call successors, (85), 24 states have call predecessors, (85), 23 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand 242 states. [2022-04-28 05:55:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:55:56,832 INFO L93 Difference]: Finished difference Result 242 states and 318 transitions. [2022-04-28 05:55:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 318 transitions. [2022-04-28 05:55:56,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:55:56,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:55:56,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:55:56,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:55:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 131 states have internal predecessors, (147), 85 states have call successors, (85), 24 states have call predecessors, (85), 23 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2022-04-28 05:55:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 315 transitions. [2022-04-28 05:55:56,838 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 315 transitions. Word has length 132 [2022-04-28 05:55:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:55:56,838 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 315 transitions. [2022-04-28 05:55:56,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 7 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-28 05:55:56,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 239 states and 315 transitions. [2022-04-28 05:55:57,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:55:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 315 transitions. [2022-04-28 05:55:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 05:55:57,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:55:57,501 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:55:57,531 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 05:55:57,732 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 05:55:57,732 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:55:57,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:55:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1068997356, now seen corresponding path program 7 times [2022-04-28 05:55:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:55:57,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829027876] [2022-04-28 05:55:57,733 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:55:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1068997356, now seen corresponding path program 8 times [2022-04-28 05:55:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:55:57,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637595338] [2022-04-28 05:55:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:55:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:55:57,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:55:57,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448992311] [2022-04-28 05:55:57,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 05:55:57,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:55:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:55:57,760 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 05:55:57,761 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 05:55:57,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 05:55:57,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:55:57,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 05:55:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:55:57,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:55:58,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {25794#true} call ULTIMATE.init(); {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {25794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25794#true} {25794#true} #103#return; {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {25794#true} call #t~ret6 := main(); {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {25794#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {25794#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25794#true} {25794#true} #79#return; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {25794#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L272 TraceCheckUtils]: 12: Hoare triple {25794#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {25794#true} {25794#true} #81#return; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L272 TraceCheckUtils]: 17: Hoare triple {25794#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {25794#true} {25794#true} #83#return; {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L272 TraceCheckUtils]: 22: Hoare triple {25794#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {25794#true} {25794#true} #85#return; {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {25794#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,881 INFO L272 TraceCheckUtils]: 28: Hoare triple {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,882 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {25794#true} {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #87#return; {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,882 INFO L272 TraceCheckUtils]: 33: Hoare triple {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,882 INFO L290 TraceCheckUtils]: 34: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,883 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {25794#true} {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #89#return; {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {25880#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,884 INFO L272 TraceCheckUtils]: 41: Hoare triple {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,884 INFO L290 TraceCheckUtils]: 42: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,884 INFO L290 TraceCheckUtils]: 43: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,885 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {25794#true} {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,885 INFO L272 TraceCheckUtils]: 46: Hoare triple {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,885 INFO L290 TraceCheckUtils]: 49: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,886 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25794#true} {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,886 INFO L272 TraceCheckUtils]: 51: Hoare triple {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,887 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {25794#true} {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,887 INFO L272 TraceCheckUtils]: 56: Hoare triple {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,887 INFO L290 TraceCheckUtils]: 57: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,887 INFO L290 TraceCheckUtils]: 59: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,888 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {25794#true} {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,890 INFO L290 TraceCheckUtils]: 61: Hoare triple {25917#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,890 INFO L290 TraceCheckUtils]: 62: Hoare triple {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,890 INFO L272 TraceCheckUtils]: 63: Hoare triple {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,890 INFO L290 TraceCheckUtils]: 64: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,890 INFO L290 TraceCheckUtils]: 65: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,890 INFO L290 TraceCheckUtils]: 66: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,891 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {25794#true} {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,891 INFO L272 TraceCheckUtils]: 68: Hoare triple {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,891 INFO L290 TraceCheckUtils]: 69: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,891 INFO L290 TraceCheckUtils]: 70: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,891 INFO L290 TraceCheckUtils]: 71: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,892 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25794#true} {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,892 INFO L272 TraceCheckUtils]: 73: Hoare triple {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,893 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25794#true} {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,895 INFO L272 TraceCheckUtils]: 78: Hoare triple {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,895 INFO L290 TraceCheckUtils]: 79: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,895 INFO L290 TraceCheckUtils]: 80: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,895 INFO L290 TraceCheckUtils]: 81: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,896 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {25794#true} {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {25984#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,897 INFO L290 TraceCheckUtils]: 84: Hoare triple {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,897 INFO L272 TraceCheckUtils]: 85: Hoare triple {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,897 INFO L290 TraceCheckUtils]: 86: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,897 INFO L290 TraceCheckUtils]: 87: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,897 INFO L290 TraceCheckUtils]: 88: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,898 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {25794#true} {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,898 INFO L272 TraceCheckUtils]: 90: Hoare triple {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,898 INFO L290 TraceCheckUtils]: 91: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,898 INFO L290 TraceCheckUtils]: 92: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,898 INFO L290 TraceCheckUtils]: 93: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,899 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25794#true} {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #93#return; {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,899 INFO L272 TraceCheckUtils]: 95: Hoare triple {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,899 INFO L290 TraceCheckUtils]: 96: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,899 INFO L290 TraceCheckUtils]: 97: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,899 INFO L290 TraceCheckUtils]: 98: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,900 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25794#true} {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #95#return; {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,900 INFO L272 TraceCheckUtils]: 100: Hoare triple {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,900 INFO L290 TraceCheckUtils]: 101: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,900 INFO L290 TraceCheckUtils]: 102: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,901 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {25794#true} {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #97#return; {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,902 INFO L290 TraceCheckUtils]: 105: Hoare triple {26051#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {26118#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,902 INFO L290 TraceCheckUtils]: 106: Hoare triple {26118#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {26118#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,902 INFO L272 TraceCheckUtils]: 107: Hoare triple {26118#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,903 INFO L290 TraceCheckUtils]: 108: Hoare triple {25794#true} ~cond := #in~cond; {26128#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:58,903 INFO L290 TraceCheckUtils]: 109: Hoare triple {26128#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {26132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:58,903 INFO L290 TraceCheckUtils]: 110: Hoare triple {26132#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {26132#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:55:58,905 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {26132#(not (= |__VERIFIER_assert_#in~cond| 0))} {26118#(and (= main_~r~0 0) (= (+ main_~c~0 (* main_~b~0 3)) main_~a~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #91#return; {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,905 INFO L272 TraceCheckUtils]: 112: Hoare triple {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,905 INFO L290 TraceCheckUtils]: 113: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,905 INFO L290 TraceCheckUtils]: 114: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,905 INFO L290 TraceCheckUtils]: 115: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,905 INFO L284 TraceCheckUtils]: 116: Hoare quadruple {25794#true} {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #93#return; {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,906 INFO L272 TraceCheckUtils]: 117: Hoare triple {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,906 INFO L290 TraceCheckUtils]: 118: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,906 INFO L290 TraceCheckUtils]: 119: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,906 INFO L290 TraceCheckUtils]: 120: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,906 INFO L284 TraceCheckUtils]: 121: Hoare quadruple {25794#true} {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #95#return; {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,906 INFO L272 TraceCheckUtils]: 122: Hoare triple {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {25794#true} is VALID [2022-04-28 05:55:58,907 INFO L290 TraceCheckUtils]: 123: Hoare triple {25794#true} ~cond := #in~cond; {25794#true} is VALID [2022-04-28 05:55:58,907 INFO L290 TraceCheckUtils]: 124: Hoare triple {25794#true} assume !(0 == ~cond); {25794#true} is VALID [2022-04-28 05:55:58,907 INFO L290 TraceCheckUtils]: 125: Hoare triple {25794#true} assume true; {25794#true} is VALID [2022-04-28 05:55:58,907 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {25794#true} {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #97#return; {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,908 INFO L290 TraceCheckUtils]: 127: Hoare triple {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-28 05:55:58,909 INFO L290 TraceCheckUtils]: 128: Hoare triple {26139#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~c~0 (* main_~y~0 3)) (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {26191#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (+ main_~x~0 (* main_~y~0 3) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= main_~q~0 1))} is VALID [2022-04-28 05:55:58,910 INFO L290 TraceCheckUtils]: 129: Hoare triple {26191#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (+ main_~x~0 (* main_~y~0 3) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= main_~q~0 1))} assume !false; {26191#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (+ main_~x~0 (* main_~y~0 3) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= main_~q~0 1))} is VALID [2022-04-28 05:55:58,910 INFO L290 TraceCheckUtils]: 130: Hoare triple {26191#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= (+ main_~x~0 (* main_~y~0 3) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= main_~q~0 1))} assume !(0 != ~b~0); {26198#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 3) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= main_~q~0 1))} is VALID [2022-04-28 05:55:58,911 INFO L272 TraceCheckUtils]: 131: Hoare triple {26198#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 3) (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0))) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {26202#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:55:58,911 INFO L290 TraceCheckUtils]: 132: Hoare triple {26202#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26206#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:55:58,911 INFO L290 TraceCheckUtils]: 133: Hoare triple {26206#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25795#false} is VALID [2022-04-28 05:55:58,912 INFO L290 TraceCheckUtils]: 134: Hoare triple {25795#false} assume !false; {25795#false} is VALID [2022-04-28 05:55:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 67 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-04-28 05:55:58,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 05:56:04,532 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:56:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 05:56:04,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637595338] [2022-04-28 05:56:04,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 05:56:04,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448992311] [2022-04-28 05:56:04,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448992311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 05:56:04,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 05:56:04,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-28 05:56:04,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 05:56:04,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829027876] [2022-04-28 05:56:04,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829027876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 05:56:04,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 05:56:04,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 05:56:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574626019] [2022-04-28 05:56:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 05:56:04,642 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) Word has length 135 [2022-04-28 05:56:04,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 05:56:04,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 05:56:04,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:04,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 05:56:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:04,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 05:56:04,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-04-28 05:56:04,729 INFO L87 Difference]: Start difference. First operand 239 states and 315 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 05:56:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:08,697 INFO L93 Difference]: Finished difference Result 280 states and 374 transitions. [2022-04-28 05:56:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 05:56:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) Word has length 135 [2022-04-28 05:56:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 05:56:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 05:56:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 05:56:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 05:56:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-28 05:56:08,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2022-04-28 05:56:08,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:08,854 INFO L225 Difference]: With dead ends: 280 [2022-04-28 05:56:08,855 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 05:56:08,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2022-04-28 05:56:08,855 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 28 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 05:56:08,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 328 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 05:56:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 05:56:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2022-04-28 05:56:09,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 05:56:09,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 274 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 148 states have internal predecessors, (167), 101 states have call successors, (101), 26 states have call predecessors, (101), 25 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 05:56:09,759 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 274 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 148 states have internal predecessors, (167), 101 states have call successors, (101), 26 states have call predecessors, (101), 25 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 05:56:09,759 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 274 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 148 states have internal predecessors, (167), 101 states have call successors, (101), 26 states have call predecessors, (101), 25 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 05:56:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:09,765 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2022-04-28 05:56:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 370 transitions. [2022-04-28 05:56:09,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:09,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:09,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 148 states have internal predecessors, (167), 101 states have call successors, (101), 26 states have call predecessors, (101), 25 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand 277 states. [2022-04-28 05:56:09,767 INFO L87 Difference]: Start difference. First operand has 274 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 148 states have internal predecessors, (167), 101 states have call successors, (101), 26 states have call predecessors, (101), 25 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand 277 states. [2022-04-28 05:56:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 05:56:09,771 INFO L93 Difference]: Finished difference Result 277 states and 370 transitions. [2022-04-28 05:56:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 370 transitions. [2022-04-28 05:56:09,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 05:56:09,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 05:56:09,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 05:56:09,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 05:56:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 147 states have (on average 1.1360544217687074) internal successors, (167), 148 states have internal predecessors, (167), 101 states have call successors, (101), 26 states have call predecessors, (101), 25 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2022-04-28 05:56:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 367 transitions. [2022-04-28 05:56:09,778 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 367 transitions. Word has length 135 [2022-04-28 05:56:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 05:56:09,778 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 367 transitions. [2022-04-28 05:56:09,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 8 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 6 states have call predecessors, (23), 7 states have call successors, (23) [2022-04-28 05:56:09,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 274 states and 367 transitions. [2022-04-28 05:56:10,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 05:56:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 367 transitions. [2022-04-28 05:56:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-28 05:56:10,582 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 05:56:10,582 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 05:56:10,599 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 05:56:10,786 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 05:56:10,786 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 05:56:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 05:56:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash -896647763, now seen corresponding path program 9 times [2022-04-28 05:56:10,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 05:56:10,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865155187] [2022-04-28 05:56:10,787 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 05:56:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash -896647763, now seen corresponding path program 10 times [2022-04-28 05:56:10,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 05:56:10,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236744239] [2022-04-28 05:56:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 05:56:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 05:56:10,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 05:56:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934327273] [2022-04-28 05:56:10,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 05:56:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 05:56:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 05:56:10,799 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 05:56:10,800 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 05:56:10,867 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 05:56:10,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 05:56:10,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 05:56:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 05:56:10,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 05:56:34,923 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:56:43,010 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:56:49,064 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:57:07,321 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:57:11,967 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:57:12,032 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 05:57:12,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {27958#true} call ULTIMATE.init(); {27958#true} is VALID [2022-04-28 05:57:12,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {27958#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {27958#true} is VALID [2022-04-28 05:57:12,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27958#true} {27958#true} #103#return; {27958#true} is VALID [2022-04-28 05:57:12,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {27958#true} call #t~ret6 := main(); {27958#true} is VALID [2022-04-28 05:57:12,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {27958#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {27958#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27958#true} {27958#true} #79#return; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {27958#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L272 TraceCheckUtils]: 12: Hoare triple {27958#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27958#true} {27958#true} #81#return; {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L272 TraceCheckUtils]: 17: Hoare triple {27958#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,941 INFO L290 TraceCheckUtils]: 18: Hoare triple {27958#true} ~cond := #in~cond; {28017#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 05:57:12,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {28017#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {28021#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:57:12,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {28021#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {28021#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 05:57:12,966 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {28021#(not (= |assume_abort_if_not_#in~cond| 0))} {27958#true} #83#return; {28028#(<= 1 main_~x~0)} is VALID [2022-04-28 05:57:12,966 INFO L272 TraceCheckUtils]: 22: Hoare triple {28028#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,966 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27958#true} {28028#(<= 1 main_~x~0)} #85#return; {28028#(<= 1 main_~x~0)} is VALID [2022-04-28 05:57:12,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {28028#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:57:12,967 INFO L272 TraceCheckUtils]: 28: Hoare triple {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,968 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {27958#true} {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #87#return; {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:57:12,968 INFO L272 TraceCheckUtils]: 33: Hoare triple {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,968 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27958#true} {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #89#return; {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:57:12,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !false; {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-28 05:57:12,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {28047#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !false; {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,970 INFO L272 TraceCheckUtils]: 41: Hoare triple {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,971 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {27958#true} {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #91#return; {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,971 INFO L272 TraceCheckUtils]: 46: Hoare triple {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,972 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {27958#true} {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #93#return; {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,972 INFO L272 TraceCheckUtils]: 51: Hoare triple {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,972 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {27958#true} {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #95#return; {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,973 INFO L272 TraceCheckUtils]: 56: Hoare triple {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,973 INFO L290 TraceCheckUtils]: 57: Hoare triple {27958#true} ~cond := #in~cond; {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:12,973 INFO L290 TraceCheckUtils]: 58: Hoare triple {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:12,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:12,974 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #97#return; {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {28084#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {28153#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-28 05:57:12,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {28153#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28157#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,975 INFO L290 TraceCheckUtils]: 63: Hoare triple {28157#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {28157#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {28157#(and (= main_~s~0 0) (<= 1 main_~x~0) (not (<= main_~y~0 main_~x~0)) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,976 INFO L272 TraceCheckUtils]: 66: Hoare triple {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,977 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {27958#true} {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #91#return; {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,977 INFO L272 TraceCheckUtils]: 71: Hoare triple {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,977 INFO L290 TraceCheckUtils]: 72: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,978 INFO L290 TraceCheckUtils]: 74: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,978 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {27958#true} {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #93#return; {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,978 INFO L272 TraceCheckUtils]: 76: Hoare triple {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,978 INFO L290 TraceCheckUtils]: 77: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,978 INFO L290 TraceCheckUtils]: 78: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,978 INFO L290 TraceCheckUtils]: 79: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,979 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {27958#true} {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #95#return; {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,979 INFO L272 TraceCheckUtils]: 81: Hoare triple {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,979 INFO L290 TraceCheckUtils]: 82: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,979 INFO L290 TraceCheckUtils]: 83: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,979 INFO L290 TraceCheckUtils]: 84: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,980 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {27958#true} {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #97#return; {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,982 INFO L290 TraceCheckUtils]: 86: Hoare triple {28164#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,983 INFO L290 TraceCheckUtils]: 87: Hoare triple {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !false; {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,983 INFO L272 TraceCheckUtils]: 88: Hoare triple {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,983 INFO L290 TraceCheckUtils]: 89: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,983 INFO L290 TraceCheckUtils]: 90: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,983 INFO L290 TraceCheckUtils]: 91: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,983 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {27958#true} {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #91#return; {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,984 INFO L272 TraceCheckUtils]: 93: Hoare triple {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,984 INFO L290 TraceCheckUtils]: 94: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,984 INFO L290 TraceCheckUtils]: 95: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,984 INFO L290 TraceCheckUtils]: 96: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,984 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {27958#true} {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #93#return; {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,984 INFO L272 TraceCheckUtils]: 98: Hoare triple {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,984 INFO L290 TraceCheckUtils]: 99: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,985 INFO L290 TraceCheckUtils]: 100: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,985 INFO L290 TraceCheckUtils]: 101: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,985 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {27958#true} {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #95#return; {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,985 INFO L272 TraceCheckUtils]: 103: Hoare triple {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,985 INFO L290 TraceCheckUtils]: 104: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:12,985 INFO L290 TraceCheckUtils]: 105: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:12,986 INFO L290 TraceCheckUtils]: 106: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:12,986 INFO L284 TraceCheckUtils]: 107: Hoare quadruple {27958#true} {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #97#return; {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-28 05:57:12,987 INFO L290 TraceCheckUtils]: 108: Hoare triple {28231#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {28298#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} is VALID [2022-04-28 05:57:12,988 INFO L290 TraceCheckUtils]: 109: Hoare triple {28298#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} assume !false; {28298#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} is VALID [2022-04-28 05:57:12,988 INFO L272 TraceCheckUtils]: 110: Hoare triple {28298#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,988 INFO L290 TraceCheckUtils]: 111: Hoare triple {27958#true} ~cond := #in~cond; {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:12,988 INFO L290 TraceCheckUtils]: 112: Hoare triple {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:12,989 INFO L290 TraceCheckUtils]: 113: Hoare triple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:12,989 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} {28298#(and (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} #91#return; {28317#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} is VALID [2022-04-28 05:57:12,990 INFO L272 TraceCheckUtils]: 115: Hoare triple {28317#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:12,990 INFO L290 TraceCheckUtils]: 116: Hoare triple {27958#true} ~cond := #in~cond; {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:13,007 INFO L290 TraceCheckUtils]: 117: Hoare triple {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:13,007 INFO L290 TraceCheckUtils]: 118: Hoare triple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:13,010 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} {28317#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~c~0 (* main_~b~0 2)) main_~a~0))} #93#return; {28333#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 05:57:13,010 INFO L272 TraceCheckUtils]: 120: Hoare triple {28333#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:13,010 INFO L290 TraceCheckUtils]: 121: Hoare triple {27958#true} ~cond := #in~cond; {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:13,010 INFO L290 TraceCheckUtils]: 122: Hoare triple {28139#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:13,011 INFO L290 TraceCheckUtils]: 123: Hoare triple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 05:57:13,012 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {28143#(not (= |__VERIFIER_assert_#in~cond| 0))} {28333#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} #95#return; {28349#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 05:57:13,012 INFO L272 TraceCheckUtils]: 125: Hoare triple {28349#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} call __VERIFIER_assert((if 0 == ~q~0 * ~xy~0 + ~s~0 * ~yy~0 - ~q~0 * ~x~0 - ~b~0 * ~y~0 - ~s~0 * ~y~0 + ~b~0 then 1 else 0)); {27958#true} is VALID [2022-04-28 05:57:13,012 INFO L290 TraceCheckUtils]: 126: Hoare triple {27958#true} ~cond := #in~cond; {27958#true} is VALID [2022-04-28 05:57:13,012 INFO L290 TraceCheckUtils]: 127: Hoare triple {27958#true} assume !(0 == ~cond); {27958#true} is VALID [2022-04-28 05:57:13,012 INFO L290 TraceCheckUtils]: 128: Hoare triple {27958#true} assume true; {27958#true} is VALID [2022-04-28 05:57:13,013 INFO L284 TraceCheckUtils]: 129: Hoare quadruple {27958#true} {28349#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} #97#return; {28349#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} is VALID [2022-04-28 05:57:13,015 INFO L290 TraceCheckUtils]: 130: Hoare triple {28349#(and (= main_~s~0 0) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} assume !(~c~0 >= ~b~0); {28368#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~r~0 1))} is VALID [2022-04-28 05:57:13,019 INFO L290 TraceCheckUtils]: 131: Hoare triple {28368#(and (< main_~c~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~k~0 main_~y~0 main_~s~0) main_~c~0 (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 main_~y~0) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~r~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {28372#(and (= (+ (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0))) main_~b~0) main_~y~0) (< main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* 2 (* (div main_~x~0 main_~x~0) main_~x~0)) (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0)))))} is VALID [2022-04-28 05:57:13,020 INFO L290 TraceCheckUtils]: 132: Hoare triple {28372#(and (= (+ (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0))) main_~b~0) main_~y~0) (< main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* 2 (* (div main_~x~0 main_~x~0) main_~x~0)) (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0)))))} assume !false; {28372#(and (= (+ (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0))) main_~b~0) main_~y~0) (< main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* 2 (* (div main_~x~0 main_~x~0) main_~x~0)) (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0)))))} is VALID [2022-04-28 05:57:13,020 INFO L290 TraceCheckUtils]: 133: Hoare triple {28372#(and (= (+ (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0))) main_~b~0) main_~y~0) (< main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* 2 (* (div main_~x~0 main_~x~0) main_~x~0)) (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0)))))} assume !(0 != ~b~0); {28379#(and (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0))) main_~y~0) (= (* 2 (* (div main_~x~0 main_~x~0) main_~x~0)) (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0)))))} is VALID [2022-04-28 05:57:13,023 INFO L272 TraceCheckUtils]: 134: Hoare triple {28379#(and (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0))) main_~y~0) (= (* 2 (* (div main_~x~0 main_~x~0) main_~x~0)) (* (div main_~x~0 main_~x~0) main_~x~0 (div (* (- 1) main_~q~0) (div main_~x~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {28383#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 05:57:13,023 INFO L290 TraceCheckUtils]: 135: Hoare triple {28383#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {28387#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 05:57:13,024 INFO L290 TraceCheckUtils]: 136: Hoare triple {28387#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27959#false} is VALID [2022-04-28 05:57:13,024 INFO L290 TraceCheckUtils]: 137: Hoare triple {27959#false} assume !false; {27959#false} is VALID [2022-04-28 05:57:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 142 proven. 92 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-04-28 05:57:13,024 INFO L328 TraceCheckSpWp]: Computing backward predicates...