/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 05:43:01,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 05:43:01,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 05:43:01,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 05:43:01,654 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 05:43:01,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 05:43:01,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 05:43:01,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 05:43:01,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 05:43:01,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 05:43:01,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 05:43:01,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 05:43:01,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 05:43:01,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 05:43:01,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 05:43:01,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 05:43:01,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 05:43:01,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 05:43:01,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 05:43:01,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 05:43:01,673 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 05:43:01,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 05:43:01,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 05:43:01,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 05:43:01,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 05:43:01,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 05:43:01,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 05:43:01,689 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 05:43:01,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 05:43:01,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 05:43:01,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 05:43:01,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 05:43:01,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 05:43:01,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 05:43:01,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 05:43:01,693 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 05:43:01,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 05:43:01,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 05:43:01,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 05:43:01,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 05:43:01,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 05:43:01,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 05:43:01,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 05:43:01,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 05:43:01,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 05:43:01,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 05:43:01,706 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 05:43:01,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 05:43:01,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 05:43:01,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 05:43:01,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 05:43:01,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 05:43:01,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 05:43:01,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:43:01,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 05:43:01,708 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 05:43:01,709 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 05:43:01,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 05:43:01,709 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 05:43:01,709 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-08 05:43:01,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 05:43:01,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 05:43:01,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 05:43:01,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 05:43:01,928 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 05:43:01,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c [2022-04-08 05:43:01,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238678cd8/18ab38a6d4c74757835b59945bf3ab05/FLAG1ffdc4f38 [2022-04-08 05:43:02,347 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 05:43:02,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound10.c [2022-04-08 05:43:02,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238678cd8/18ab38a6d4c74757835b59945bf3ab05/FLAG1ffdc4f38 [2022-04-08 05:43:02,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238678cd8/18ab38a6d4c74757835b59945bf3ab05 [2022-04-08 05:43:02,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 05:43:02,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 05:43:02,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 05:43:02,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 05:43:02,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 05:43:02,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c187d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02, skipping insertion in model container [2022-04-08 05:43:02,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 05:43:02,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 05:43:02,862 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_unwindbound10.c[490,503] [2022-04-08 05:43:02,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:43:02,897 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 05:43:02,909 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_unwindbound10.c[490,503] [2022-04-08 05:43:02,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 05:43:02,936 INFO L208 MainTranslator]: Completed translation [2022-04-08 05:43:02,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02 WrapperNode [2022-04-08 05:43:02,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 05:43:02,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 05:43:02,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 05:43:02,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 05:43:02,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 05:43:02,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 05:43:02,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 05:43:02,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 05:43:02,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (1/1) ... [2022-04-08 05:43:02,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 05:43:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:03,009 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-08 05:43:03,025 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-08 05:43:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 05:43:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 05:43:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 05:43:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 05:43:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 05:43:03,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 05:43:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 05:43:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 05:43:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 05:43:03,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 05:43:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 05:43:03,045 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 05:43:03,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 05:43:03,090 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 05:43:03,091 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 05:43:03,297 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 05:43:03,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 05:43:03,302 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 05:43:03,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:43:03 BoogieIcfgContainer [2022-04-08 05:43:03,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 05:43:03,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 05:43:03,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 05:43:03,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 05:43:03,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 05:43:02" (1/3) ... [2022-04-08 05:43:03,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28967029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:43:03, skipping insertion in model container [2022-04-08 05:43:03,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 05:43:02" (2/3) ... [2022-04-08 05:43:03,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28967029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 05:43:03, skipping insertion in model container [2022-04-08 05:43:03,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 05:43:03" (3/3) ... [2022-04-08 05:43:03,317 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound10.c [2022-04-08 05:43:03,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 05:43:03,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 05:43:03,361 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 05:43:03,374 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 05:43:03,375 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 05:43:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 05:43:03,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 05:43:03,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:03,401 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:43:03,402 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:03,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-08 05:43:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:03,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119703220] [2022-04-08 05:43:03,424 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-08 05:43:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:03,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946929020] [2022-04-08 05:43:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 05:43:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:03,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {42#true} is VALID [2022-04-08 05:43:03,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 05:43:03,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-08 05:43:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 05:43:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:03,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-08 05:43:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 05:43:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:03,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-08 05:43:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 05:43:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:03,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-08 05:43:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 05:43:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:03,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-08 05:43:03,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 05:43:03,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {42#true} is VALID [2022-04-08 05:43:03,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 05:43:03,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-08 05:43:03,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-08 05:43:03,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-08 05:43:03,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-08 05:43:03,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-08 05:43:03,686 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-08 05:43:03,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,688 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-08 05:43:03,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#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; {43#false} is VALID [2022-04-08 05:43:03,688 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-08 05:43:03,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,690 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-08 05:43:03,690 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-08 05:43:03,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-08 05:43:03,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-08 05:43:03,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-08 05:43:03,693 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-08 05:43:03,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-08 05:43:03,695 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-08 05:43:03,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-08 05:43:03,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-08 05:43:03,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 05:43:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:43:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:03,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946929020] [2022-04-08 05:43:03,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946929020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:03,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:03,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:43:03,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:03,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119703220] [2022-04-08 05:43:03,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119703220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:03,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:03,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 05:43:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30903932] [2022-04-08 05:43:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:03,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-08 05:43:03,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:03,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:03,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:03,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 05:43:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:03,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 05:43:03,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 05:43:03,776 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:03,976 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-08 05:43:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 05:43:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-08 05:43:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-08 05:43:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-08 05:43:03,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-08 05:43:04,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:04,121 INFO L225 Difference]: With dead ends: 72 [2022-04-08 05:43:04,121 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 05:43:04,125 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-08 05:43:04,128 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:43:04,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:43:04,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 05:43:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 05:43:04,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:04,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,158 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,159 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:04,171 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 05:43:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 05:43:04,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:04,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:04,173 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-08 05:43:04,173 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-08 05:43:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:04,177 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 05:43:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 05:43:04,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:04,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:04,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:04,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 05:43:04,182 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-08 05:43:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:04,182 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-08 05:43:04,182 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:04,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 05:43:04,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 05:43:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 05:43:04,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:04,226 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:43:04,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 05:43:04,226 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-08 05:43:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:04,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847258807] [2022-04-08 05:43:04,229 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:04,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-08 05:43:04,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:04,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936695759] [2022-04-08 05:43:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:04,261 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:04,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585432278] [2022-04-08 05:43:04,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:04,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:04,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:04,266 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-08 05:43:04,304 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-08 05:43:04,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:43:04,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:04,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:43:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:04,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:04,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-08 05:43:04,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,542 INFO L272 TraceCheckUtils]: 11: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,543 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#(<= ~counter~0 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; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,544 INFO L272 TraceCheckUtils]: 17: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,545 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,546 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,546 INFO L272 TraceCheckUtils]: 22: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,548 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:04,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {435#(<= |main_#t~post6| 0)} is VALID [2022-04-08 05:43:04,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {349#false} is VALID [2022-04-08 05:43:04,550 INFO L272 TraceCheckUtils]: 29: Hoare triple {349#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {349#false} is VALID [2022-04-08 05:43:04,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-08 05:43:04,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-08 05:43:04,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-08 05:43:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:43:04,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:43:04,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:04,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936695759] [2022-04-08 05:43:04,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:43:04,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585432278] [2022-04-08 05:43:04,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585432278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:04,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:04,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:43:04,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:04,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847258807] [2022-04-08 05:43:04,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847258807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:04,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:04,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 05:43:04,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070924305] [2022-04-08 05:43:04,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:04,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 05:43:04,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:04,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:04,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:04,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 05:43:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 05:43:04,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:43:04,578 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:04,674 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-08 05:43:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 05:43:04,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 05:43:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 05:43:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-08 05:43:04,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-08 05:43:04,720 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-08 05:43:04,721 INFO L225 Difference]: With dead ends: 44 [2022-04-08 05:43:04,721 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 05:43:04,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 05:43:04,722 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:43:04,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:43:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 05:43:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 05:43:04,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:04,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,734 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,734 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:04,736 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 05:43:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 05:43:04,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:04,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:04,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-08 05:43:04,737 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-08 05:43:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:04,739 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 05:43:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 05:43:04,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:04,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:04,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:04,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-08 05:43:04,741 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-08 05:43:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:04,741 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-08 05:43:04,742 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:04,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-08 05:43:04,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-08 05:43:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 05:43:04,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:04,779 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:43:04,798 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-08 05:43:04,991 WARN L460 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-08 05:43:04,992 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-08 05:43:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:04,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1441820979] [2022-04-08 05:43:04,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-08 05:43:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:04,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963026177] [2022-04-08 05:43:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:05,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:05,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606057736] [2022-04-08 05:43:05,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:05,016 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-08 05:43:05,017 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-08 05:43:05,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:43:05,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:05,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:43:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:05,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:05,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-08 05:43:05,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {682#true} is VALID [2022-04-08 05:43:05,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-08 05:43:05,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-08 05:43:05,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-08 05:43:05,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 05:43:05,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 05:43:05,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-08 05:43:05,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:43:05,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:05,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:05,192 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-08 05:43:05,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 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; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,192 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 05:43:05,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 05:43:05,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,193 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,193 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 05:43:05,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 05:43:05,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,194 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,195 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-08 05:43:05,195 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-08 05:43:05,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-08 05:43:05,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-08 05:43:05,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-08 05:43:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 05:43:05,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:43:05,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-08 05:43:05,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-08 05:43:05,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-08 05:43:05,396 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-08 05:43:05,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-08 05:43:05,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,397 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 05:43:05,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 05:43:05,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,398 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 05:43:05,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 05:43:05,399 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 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; {738#(<= 1 main_~b~0)} is VALID [2022-04-08 05:43:05,400 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-08 05:43:05,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:05,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:05,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 05:43:05,401 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,401 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-08 05:43:05,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-08 05:43:05,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-08 05:43:05,402 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-08 05:43:05,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-08 05:43:05,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-08 05:43:05,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-08 05:43:05,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-08 05:43:05,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {682#true} is VALID [2022-04-08 05:43:05,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-08 05:43:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 05:43:05,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:05,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963026177] [2022-04-08 05:43:05,403 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:43:05,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606057736] [2022-04-08 05:43:05,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606057736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:43:05,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:43:05,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-08 05:43:05,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1441820979] [2022-04-08 05:43:05,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1441820979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:05,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:05,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:43:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18200399] [2022-04-08 05:43:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:05,407 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 05:43:05,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:05,408 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:05,435 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-08 05:43:05,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:43:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:43:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:43:05,437 INFO L87 Difference]: Start difference. First operand 36 states and 47 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:05,720 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-08 05:43:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:43:05,721 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 05:43:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:05,721 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 05:43:05,723 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-08 05:43:05,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-08 05:43:05,780 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-08 05:43:05,782 INFO L225 Difference]: With dead ends: 53 [2022-04-08 05:43:05,782 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 05:43:05,782 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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-08 05:43:05,783 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:43:05,783 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:43:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 05:43:05,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-08 05:43:05,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:05,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:05,807 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:05,808 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:05,809 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-08 05:43:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 05:43:05,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:05,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:05,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 05:43:05,811 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-08 05:43:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:05,812 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-08 05:43:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-08 05:43:05,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:05,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:05,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:05,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:05,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 05:43:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-08 05:43:05,814 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-08 05:43:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:05,814 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-08 05:43:05,814 INFO L479 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:05,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-08 05:43:05,851 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-08 05:43:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-08 05:43:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 05:43:05,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:05,852 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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-08 05:43:05,871 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-08 05:43:06,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 05:43:06,067 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-08 05:43:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:06,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1334830818] [2022-04-08 05:43:06,068 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:06,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-08 05:43:06,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:06,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691850714] [2022-04-08 05:43:06,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:06,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:06,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272380416] [2022-04-08 05:43:06,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:06,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:06,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:06,084 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-08 05:43:06,085 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-08 05:43:06,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 05:43:06,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:06,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 05:43:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:06,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:06,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1166#true} {1166#true} #98#return; {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {1166#true} call #t~ret8 := main(); {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1166#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {1166#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 05:43:06,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1166#true} {1166#true} #78#return; {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L272 TraceCheckUtils]: 11: Hoare triple {1166#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1166#true} {1166#true} #80#return; {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {1166#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; {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L272 TraceCheckUtils]: 17: Hoare triple {1166#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-08 05:43:06,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1166#true} {1166#true} #82#return; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L272 TraceCheckUtils]: 22: Hoare triple {1166#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {1166#true} ~cond := #in~cond; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#true} assume !(0 == ~cond); {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {1166#true} assume true; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1166#true} {1166#true} #84#return; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {1166#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1166#true} is VALID [2022-04-08 05:43:06,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {1166#true} assume !!(#t~post6 < 10);havoc #t~post6; {1166#true} is VALID [2022-04-08 05:43:06,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {1166#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:43:06,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:43:06,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} assume !!(#t~post7 < 10);havoc #t~post7; {1258#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (not (= main_~b~0 0)))} is VALID [2022-04-08 05:43:06,249 INFO L272 TraceCheckUtils]: 32: Hoare triple {1258#(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)); {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:43:06,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {1268#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:06,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {1272#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1167#false} is VALID [2022-04-08 05:43:06,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-08 05:43:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:43:06,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:43:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:06,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691850714] [2022-04-08 05:43:06,254 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:43:06,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272380416] [2022-04-08 05:43:06,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272380416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:06,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:06,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:43:06,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:06,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1334830818] [2022-04-08 05:43:06,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1334830818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:06,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:06,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:43:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942481211] [2022-04-08 05:43:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-08 05:43:06,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:06,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:43:06,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:06,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:43:06,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:06,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:43:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:43:06,271 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:43:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:06,446 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-04-08 05:43:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:43:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-08 05:43:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:43:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 05:43:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:43:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-08 05:43:06,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-08 05:43:06,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:06,493 INFO L225 Difference]: With dead ends: 51 [2022-04-08 05:43:06,493 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 05:43:06,493 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-08 05:43:06,494 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 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-08 05:43:06,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:43:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 05:43:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2022-04-08 05:43:06,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:06,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:06,527 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:06,527 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:06,529 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 05:43:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 05:43:06,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:06,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:06,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-08 05:43:06,530 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 49 states. [2022-04-08 05:43:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:06,532 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 05:43:06,532 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 05:43:06,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:06,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:06,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:06,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-04-08 05:43:06,534 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 36 [2022-04-08 05:43:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:06,534 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-04-08 05:43:06,534 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 05:43:06,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 56 transitions. [2022-04-08 05:43:06,579 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-08 05:43:06,579 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-08 05:43:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 05:43:06,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:06,580 INFO L499 BasicCegarLoop]: trace histogram [4, 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] [2022-04-08 05:43:06,596 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-08 05:43:06,795 WARN L460 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-08 05:43:06,795 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:06,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-08 05:43:06,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:06,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [574798117] [2022-04-08 05:43:06,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:06,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-08 05:43:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:06,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619174222] [2022-04-08 05:43:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:06,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:06,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065685428] [2022-04-08 05:43:06,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:06,838 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-08 05:43:06,839 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-08 05:43:06,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:43:06,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:06,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:43:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:06,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:07,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-08 05:43:07,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1576#(<= ~counter~0 0)} {1568#true} #98#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {1576#(<= ~counter~0 0)} call #t~ret8 := main(); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,067 INFO L272 TraceCheckUtils]: 6: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,071 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #78#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,073 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #80#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {1576#(<= ~counter~0 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; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,074 INFO L272 TraceCheckUtils]: 17: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,096 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #82#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,096 INFO L272 TraceCheckUtils]: 22: Hoare triple {1576#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {1576#(<= ~counter~0 0)} ~cond := #in~cond; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {1576#(<= ~counter~0 0)} assume !(0 == ~cond); {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {1576#(<= ~counter~0 0)} assume true; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,098 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1576#(<= ~counter~0 0)} {1576#(<= ~counter~0 0)} #84#return; {1576#(<= ~counter~0 0)} is VALID [2022-04-08 05:43:07,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {1576#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-08 05:43:07,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {1655#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {1655#(<= ~counter~0 1)} is VALID [2022-04-08 05:43:07,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {1655#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1655#(<= ~counter~0 1)} is VALID [2022-04-08 05:43:07,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {1655#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1665#(<= |main_#t~post7| 1)} is VALID [2022-04-08 05:43:07,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {1665#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {1569#false} is VALID [2022-04-08 05:43:07,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {1569#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; {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {1569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {1569#false} assume !(#t~post6 < 10);havoc #t~post6; {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L272 TraceCheckUtils]: 35: Hoare triple {1569#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {1569#false} ~cond := #in~cond; {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {1569#false} assume 0 == ~cond; {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-08 05:43:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:43:07,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:43:07,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:07,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619174222] [2022-04-08 05:43:07,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:43:07,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065685428] [2022-04-08 05:43:07,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065685428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:07,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:07,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:43:07,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:07,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [574798117] [2022-04-08 05:43:07,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [574798117] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:07,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:07,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:43:07,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988391078] [2022-04-08 05:43:07,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:07,102 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-08 05:43:07,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:07,102 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:07,121 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-08 05:43:07,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:43:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:43:07,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:43:07,122 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:07,275 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-04-08 05:43:07,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:43:07,276 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-08 05:43:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:07,276 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 05:43:07,277 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), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-08 05:43:07,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-08 05:43:07,326 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-08 05:43:07,327 INFO L225 Difference]: With dead ends: 72 [2022-04-08 05:43:07,328 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 05:43:07,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:43:07,328 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:43:07,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:43:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 05:43:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-08 05:43:07,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:07,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:07,360 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:07,360 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:07,362 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 05:43:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 05:43:07,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:07,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:07,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-08 05:43:07,362 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-04-08 05:43:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:07,364 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-08 05:43:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 05:43:07,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:07,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:07,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:07,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 05:43:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-04-08 05:43:07,366 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 39 [2022-04-08 05:43:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:07,366 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-04-08 05:43:07,366 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 05:43:07,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 58 transitions. [2022-04-08 05:43:07,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-04-08 05:43:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 05:43:07,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:07,414 INFO L499 BasicCegarLoop]: trace histogram [4, 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] [2022-04-08 05:43:07,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 05:43:07,628 WARN L460 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-08 05:43:07,628 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 1 times [2022-04-08 05:43:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:07,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615981368] [2022-04-08 05:43:07,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:07,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1052701339, now seen corresponding path program 2 times [2022-04-08 05:43:07,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:07,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240044998] [2022-04-08 05:43:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:07,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:07,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831096137] [2022-04-08 05:43:07,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:07,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:07,641 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-08 05:43:07,681 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-08 05:43:07,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:43:07,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:07,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 05:43:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:07,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:07,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:07,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-08 05:43:07,929 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:07,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:43:07,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {2058#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:07,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2062#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:07,930 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2062#(not (= |assume_abort_if_not_#in~cond| 0))} {2017#true} #80#return; {2069#(<= 1 main_~y~0)} is VALID [2022-04-08 05:43:07,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(<= 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; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,930 INFO L272 TraceCheckUtils]: 17: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:07,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:07,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:07,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:07,932 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #82#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,932 INFO L272 TraceCheckUtils]: 22: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:07,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:07,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:07,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:07,934 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #84#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,935 INFO L290 TraceCheckUtils]: 27: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,939 INFO L272 TraceCheckUtils]: 32: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~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)); {2017#true} is VALID [2022-04-08 05:43:07,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:07,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:07,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:07,939 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {2073#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:43:07,940 INFO L272 TraceCheckUtils]: 37: Hoare triple {2073#(and (= main_~r~0 0) (<= 1 main_~y~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)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:43:07,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:07,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-08 05:43:07,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-08 05:43:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 05:43:07,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:43:08,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2022-04-08 05:43:08,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {2141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2018#false} is VALID [2022-04-08 05:43:08,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:08,129 INFO L272 TraceCheckUtils]: 37: Hoare triple {2157#(= 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)); {2137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:43:08,130 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:08,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:08,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:08,130 INFO L272 TraceCheckUtils]: 32: Hoare triple {2157#(= 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)); {2017#true} is VALID [2022-04-08 05:43:08,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {2157#(= 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; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,133 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #84#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:08,133 INFO L290 TraceCheckUtils]: 24: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:08,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:08,133 INFO L272 TraceCheckUtils]: 22: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:08,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2017#true} {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #82#return; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:08,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:08,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:08,134 INFO L272 TraceCheckUtils]: 17: Hoare triple {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:08,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {2017#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; {2157#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:43:08,135 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2017#true} {2017#true} #80#return; {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L272 TraceCheckUtils]: 11: Hoare triple {2017#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2017#true} {2017#true} #78#return; {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {2017#true} assume !(0 == ~cond); {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {2017#true} ~cond := #in~cond; {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L272 TraceCheckUtils]: 6: Hoare triple {2017#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2017#true} is VALID [2022-04-08 05:43:08,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {2017#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2017#true} is VALID [2022-04-08 05:43:08,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret8 := main(); {2017#true} is VALID [2022-04-08 05:43:08,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #98#return; {2017#true} is VALID [2022-04-08 05:43:08,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2022-04-08 05:43:08,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {2017#true} is VALID [2022-04-08 05:43:08,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2022-04-08 05:43:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 05:43:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:08,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240044998] [2022-04-08 05:43:08,136 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:43:08,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831096137] [2022-04-08 05:43:08,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831096137] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 05:43:08,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:43:08,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-08 05:43:08,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:08,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615981368] [2022-04-08 05:43:08,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615981368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:08,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:08,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:43:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396563203] [2022-04-08 05:43:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:08,138 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-08 05:43:08,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:08,138 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:43:08,159 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-08 05:43:08,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:43:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:43:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:43:08,159 INFO L87 Difference]: Start difference. First operand 46 states and 58 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:43:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:08,365 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-04-08 05:43:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:43:08,366 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-08 05:43:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:08,366 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:43:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 05:43:08,367 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:43:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 05:43:08,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 05:43:08,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:08,414 INFO L225 Difference]: With dead ends: 61 [2022-04-08 05:43:08,414 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 05:43:08,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:43:08,415 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 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-08 05:43:08,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:43:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 05:43:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-08 05:43:08,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:08,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:08,457 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:08,458 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:08,459 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-08 05:43:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-08 05:43:08,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:08,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:08,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 59 states. [2022-04-08 05:43:08,460 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 59 states. [2022-04-08 05:43:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:08,462 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-08 05:43:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2022-04-08 05:43:08,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:08,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:08,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:08,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 18 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2022-04-08 05:43:08,464 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 41 [2022-04-08 05:43:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:08,464 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2022-04-08 05:43:08,464 INFO L479 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 05:43:08,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 76 transitions. [2022-04-08 05:43:08,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:08,528 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2022-04-08 05:43:08,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 05:43:08,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:08,529 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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-08 05:43:08,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 05:43:08,743 WARN L460 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-08 05:43:08,744 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:08,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 1 times [2022-04-08 05:43:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:08,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [954811556] [2022-04-08 05:43:08,744 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1531994984, now seen corresponding path program 2 times [2022-04-08 05:43:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:08,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187606340] [2022-04-08 05:43:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:08,768 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:08,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1886214073] [2022-04-08 05:43:08,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:08,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:08,769 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-08 05:43:08,773 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-08 05:43:08,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:43:08,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:08,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 05:43:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:08,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:09,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-08 05:43:09,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {2629#true} is VALID [2022-04-08 05:43:09,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-08 05:43:09,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-08 05:43:09,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2629#true} is VALID [2022-04-08 05:43:09,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-08 05:43:09,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:43:09,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {2655#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:09,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2659#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:43:09,067 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2659#(not (= |assume_abort_if_not_#in~cond| 0))} {2629#true} #78#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-08 05:43:09,067 INFO L272 TraceCheckUtils]: 11: Hoare triple {2666#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-08 05:43:09,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2666#(<= 1 main_~x~0)} #80#return; {2666#(<= 1 main_~x~0)} is VALID [2022-04-08 05:43:09,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {2666#(<= 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; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,068 INFO L272 TraceCheckUtils]: 17: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2629#true} is VALID [2022-04-08 05:43:09,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,069 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #82#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,069 INFO L272 TraceCheckUtils]: 22: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2629#true} is VALID [2022-04-08 05:43:09,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,069 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,072 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #84#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,074 INFO L272 TraceCheckUtils]: 32: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2629#true} is VALID [2022-04-08 05:43:09,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,075 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #86#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,075 INFO L272 TraceCheckUtils]: 37: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2629#true} is VALID [2022-04-08 05:43:09,075 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,075 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,076 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #88#return; {2685#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-08 05:43:09,076 INFO L272 TraceCheckUtils]: 42: Hoare triple {2685#(and (<= 1 main_~x~0) (= 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)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:43:09,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:09,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-08 05:43:09,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-08 05:43:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-08 05:43:09,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:43:09,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {2630#false} assume !false; {2630#false} is VALID [2022-04-08 05:43:09,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {2768#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2630#false} is VALID [2022-04-08 05:43:09,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2768#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:09,258 INFO L272 TraceCheckUtils]: 42: Hoare triple {2784#(= 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)); {2764#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:43:09,258 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,258 INFO L290 TraceCheckUtils]: 40: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,259 INFO L272 TraceCheckUtils]: 37: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-08 05:43:09,259 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,260 INFO L272 TraceCheckUtils]: 32: Hoare triple {2784#(= 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)); {2629#true} is VALID [2022-04-08 05:43:09,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {2784#(= 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; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,262 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #84#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,262 INFO L290 TraceCheckUtils]: 25: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,262 INFO L290 TraceCheckUtils]: 24: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,262 INFO L272 TraceCheckUtils]: 22: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-08 05:43:09,266 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2629#true} {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #82#return; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,266 INFO L272 TraceCheckUtils]: 17: Hoare triple {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {2629#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; {2784#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:43:09,268 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2629#true} {2629#true} #80#return; {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L272 TraceCheckUtils]: 11: Hoare triple {2629#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2629#true} {2629#true} #78#return; {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {2629#true} assume !(0 == ~cond); {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {2629#true} ~cond := #in~cond; {2629#true} is VALID [2022-04-08 05:43:09,268 INFO L272 TraceCheckUtils]: 6: Hoare triple {2629#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {2629#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {2629#true} call #t~ret8 := main(); {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2629#true} {2629#true} #98#return; {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {2629#true} assume true; {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {2629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {2629#true} call ULTIMATE.init(); {2629#true} is VALID [2022-04-08 05:43:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 05:43:09,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:43:09,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187606340] [2022-04-08 05:43:09,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:43:09,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886214073] [2022-04-08 05:43:09,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886214073] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 05:43:09,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:43:09,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-08 05:43:09,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:43:09,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [954811556] [2022-04-08 05:43:09,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [954811556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:43:09,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:43:09,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:43:09,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834142983] [2022-04-08 05:43:09,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:43:09,270 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-08 05:43:09,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:43:09,271 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:43:09,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:09,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:43:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:09,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:43:09,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:43:09,292 INFO L87 Difference]: Start difference. First operand 58 states and 76 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:43:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:09,492 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-04-08 05:43:09,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 05:43:09,492 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-08 05:43:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:43:09,492 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:43:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 05:43:09,493 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:43:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-08 05:43:09,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-08 05:43:09,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:09,545 INFO L225 Difference]: With dead ends: 65 [2022-04-08 05:43:09,545 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 05:43:09,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:43:09,546 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:43:09,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:43:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 05:43:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 05:43:09,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:43:09,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:09,596 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:09,597 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:09,598 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-08 05:43:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-08 05:43:09,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:09,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:09,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-08 05:43:09,599 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 63 states. [2022-04-08 05:43:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:43:09,601 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-08 05:43:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-04-08 05:43:09,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:43:09,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:43:09,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:43:09,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:43:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:43:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-04-08 05:43:09,603 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 46 [2022-04-08 05:43:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:43:09,603 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-04-08 05:43:09,603 INFO L479 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 05:43:09,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 79 transitions. [2022-04-08 05:43:09,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:43:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-04-08 05:43:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 05:43:09,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:43:09,675 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-08 05:43:09,694 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-08 05:43:09,891 WARN L460 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-08 05:43:09,891 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:43:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:43:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 1 times [2022-04-08 05:43:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:43:09,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [907346416] [2022-04-08 05:43:09,892 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:43:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash -300711301, now seen corresponding path program 2 times [2022-04-08 05:43:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:43:09,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350413174] [2022-04-08 05:43:09,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:43:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:43:09,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:43:09,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895243991] [2022-04-08 05:43:09,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:43:09,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:43:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:43:09,904 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-08 05:43:09,943 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-08 05:43:09,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:43:09,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:43:09,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 05:43:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:43:09,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:43:10,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {3295#true} call ULTIMATE.init(); {3295#true} is VALID [2022-04-08 05:43:10,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {3295#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {3295#true} is VALID [2022-04-08 05:43:10,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 05:43:10,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3295#true} {3295#true} #98#return; {3295#true} is VALID [2022-04-08 05:43:10,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {3295#true} call #t~ret8 := main(); {3295#true} is VALID [2022-04-08 05:43:10,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {3295#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {3295#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3295#true} {3295#true} #78#return; {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {3295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 05:43:10,278 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3295#true} {3295#true} #80#return; {3295#true} is VALID [2022-04-08 05:43:10,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {3295#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; {3348#(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-08 05:43:10,279 INFO L272 TraceCheckUtils]: 17: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-08 05:43:10,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 05:43:10,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 05:43:10,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 05:43:10,280 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #82#return; {3348#(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-08 05:43:10,280 INFO L272 TraceCheckUtils]: 22: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-08 05:43:10,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 05:43:10,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 05:43:10,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 05:43:10,281 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #84#return; {3348#(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-08 05:43:10,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3348#(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-08 05:43:10,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {3348#(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 !!(#t~post6 < 10);havoc #t~post6; {3348#(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-08 05:43:10,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {3348#(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; {3348#(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-08 05:43:10,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3348#(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-08 05:43:10,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {3348#(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 !!(#t~post7 < 10);havoc #t~post7; {3348#(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-08 05:43:10,283 INFO L272 TraceCheckUtils]: 32: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-08 05:43:10,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {3295#true} ~cond := #in~cond; {3295#true} is VALID [2022-04-08 05:43:10,283 INFO L290 TraceCheckUtils]: 34: Hoare triple {3295#true} assume !(0 == ~cond); {3295#true} is VALID [2022-04-08 05:43:10,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {3295#true} assume true; {3295#true} is VALID [2022-04-08 05:43:10,285 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3295#true} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #86#return; {3348#(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-08 05:43:10,285 INFO L272 TraceCheckUtils]: 37: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-08 05:43:10,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:10,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:43:10,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:43:10,287 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #88#return; {3348#(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-08 05:43:10,287 INFO L272 TraceCheckUtils]: 42: Hoare triple {3348#(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)); {3295#true} is VALID [2022-04-08 05:43:10,287 INFO L290 TraceCheckUtils]: 43: Hoare triple {3295#true} ~cond := #in~cond; {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:10,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {3415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:43:10,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:43:10,289 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3419#(not (= |__VERIFIER_assert_#in~cond| 0))} {3348#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0))} #90#return; {3348#(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-08 05:43:10,289 INFO L272 TraceCheckUtils]: 47: Hoare triple {3348#(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)); {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:43:10,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {3444#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3448#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:43:10,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {3448#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3296#false} is VALID [2022-04-08 05:43:10,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#false} assume !false; {3296#false} is VALID [2022-04-08 05:43:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 05:43:10,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:04,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350413174] [2022-04-08 05:44:04,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895243991] [2022-04-08 05:44:04,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895243991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:44:04,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:44:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 05:44:04,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [907346416] [2022-04-08 05:44:04,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [907346416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:04,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:44:04,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795193401] [2022-04-08 05:44:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-08 05:44:04,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:04,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:44:04,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:04,336 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:44:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:44:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:44:04,336 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:44:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:04,709 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-08 05:44:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:44:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-08 05:44:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:44:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 05:44:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:44:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-08 05:44:04,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-08 05:44:04,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:04,771 INFO L225 Difference]: With dead ends: 69 [2022-04-08 05:44:04,771 INFO L226 Difference]: Without dead ends: 67 [2022-04-08 05:44:04,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 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-08 05:44:04,771 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:04,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 160 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:44:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-08 05:44:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-08 05:44:04,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:04,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:44:04,823 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:44:04,824 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:44:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:04,826 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-08 05:44:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-08 05:44:04,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:04,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:04,826 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 05:44:04,826 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 67 states. [2022-04-08 05:44:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:04,828 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-08 05:44:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-08 05:44:04,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:04,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:04,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:04,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.2) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 05:44:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2022-04-08 05:44:04,830 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 51 [2022-04-08 05:44:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:04,830 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2022-04-08 05:44:04,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-08 05:44:04,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 82 transitions. [2022-04-08 05:44:04,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2022-04-08 05:44:04,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 05:44:04,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:04,910 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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-08 05:44:04,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 05:44:05,110 WARN L460 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-08 05:44:05,111 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 1 times [2022-04-08 05:44:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:05,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [774239860] [2022-04-08 05:44:05,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2044027516, now seen corresponding path program 2 times [2022-04-08 05:44:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:05,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622663325] [2022-04-08 05:44:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:05,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:05,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730384408] [2022-04-08 05:44:05,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:44:05,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:05,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:05,129 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-08 05:44:05,130 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-08 05:44:05,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:44:05,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:05,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 05:44:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:05,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:05,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:05,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#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; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,377 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-08 05:44:05,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-08 05:44:05,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-08 05:44:05,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,378 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:05,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,379 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,379 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:05,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,380 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,380 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:05,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,381 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,381 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:05,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:05,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:05,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:05,382 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:05,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(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; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-08 05:44:05,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-08 05:44:05,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} is VALID [2022-04-08 05:44:05,384 INFO L272 TraceCheckUtils]: 55: Hoare triple {4041#(and (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:05,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:05,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-08 05:44:05,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-08 05:44:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:05,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:27,155 INFO L290 TraceCheckUtils]: 58: Hoare triple {3880#false} assume !false; {3880#false} is VALID [2022-04-08 05:44:27,156 INFO L290 TraceCheckUtils]: 57: Hoare triple {4055#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3880#false} is VALID [2022-04-08 05:44:27,156 INFO L290 TraceCheckUtils]: 56: Hoare triple {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4055#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:27,157 INFO L272 TraceCheckUtils]: 55: Hoare triple {4071#(= 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)); {4051#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:27,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:44:27,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:44:27,158 INFO L290 TraceCheckUtils]: 52: Hoare triple {3971#(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; {4071#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:44:27,159 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #92#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,159 INFO L272 TraceCheckUtils]: 47: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:27,160 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #90#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,160 INFO L290 TraceCheckUtils]: 45: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,160 INFO L290 TraceCheckUtils]: 44: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,161 INFO L272 TraceCheckUtils]: 42: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:27,161 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #88#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,161 INFO L290 TraceCheckUtils]: 39: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,161 INFO L290 TraceCheckUtils]: 38: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,162 INFO L272 TraceCheckUtils]: 37: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:27,162 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3879#true} {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #86#return; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,162 INFO L272 TraceCheckUtils]: 32: Hoare triple {3971#(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)); {3879#true} is VALID [2022-04-08 05:44:27,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 10);havoc #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {3879#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {3971#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {3879#true} assume !!(#t~post6 < 10);havoc #t~post6; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 27: Hoare triple {3879#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3879#true} {3879#true} #84#return; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 25: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L272 TraceCheckUtils]: 22: Hoare triple {3879#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3879#true} {3879#true} #82#return; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L272 TraceCheckUtils]: 17: Hoare triple {3879#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {3879#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; {3879#true} is VALID [2022-04-08 05:44:27,164 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3879#true} {3879#true} #80#return; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L272 TraceCheckUtils]: 11: Hoare triple {3879#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3879#true} {3879#true} #78#return; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {3879#true} assume !(0 == ~cond); {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {3879#true} ~cond := #in~cond; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {3879#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {3879#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {3879#true} call #t~ret8 := main(); {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3879#true} {3879#true} #98#return; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {3879#true} assume true; {3879#true} is VALID [2022-04-08 05:44:27,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {3879#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {3879#true} is VALID [2022-04-08 05:44:27,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {3879#true} call ULTIMATE.init(); {3879#true} is VALID [2022-04-08 05:44:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:27,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622663325] [2022-04-08 05:44:27,166 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:27,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730384408] [2022-04-08 05:44:27,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730384408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:27,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:27,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-08 05:44:27,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:27,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [774239860] [2022-04-08 05:44:27,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [774239860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:27,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:44:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401242066] [2022-04-08 05:44:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:27,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 59 [2022-04-08 05:44:27,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:27,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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-08 05:44:27,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:27,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:44:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:27,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:44:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:44:27,201 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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-08 05:44:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:27,579 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-04-08 05:44:27,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:44:27,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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 59 [2022-04-08 05:44:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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-08 05:44:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-08 05:44:27,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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-08 05:44:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-08 05:44:27,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-08 05:44:27,640 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-08 05:44:27,641 INFO L225 Difference]: With dead ends: 96 [2022-04-08 05:44:27,641 INFO L226 Difference]: Without dead ends: 94 [2022-04-08 05:44:27,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:44:27,642 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:27,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 208 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:44:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-08 05:44:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2022-04-08 05:44:27,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:27,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:27,709 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:27,709 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:27,712 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-08 05:44:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-08 05:44:27,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:27,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:27,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 94 states. [2022-04-08 05:44:27,713 INFO L87 Difference]: Start difference. First operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 94 states. [2022-04-08 05:44:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:27,716 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-08 05:44:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2022-04-08 05:44:27,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:27,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:27,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:27,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 26 states have call successors, (26), 9 states have call predecessors, (26), 8 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2022-04-08 05:44:27,719 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 59 [2022-04-08 05:44:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:27,720 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2022-04-08 05:44:27,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 3 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-08 05:44:27,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 111 transitions. [2022-04-08 05:44:27,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2022-04-08 05:44:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 05:44:27,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:27,839 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2022-04-08 05:44:27,870 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-08 05:44:28,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 05:44:28,040 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 1 times [2022-04-08 05:44:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:28,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442160394] [2022-04-08 05:44:28,040 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash 35160305, now seen corresponding path program 2 times [2022-04-08 05:44:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:28,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671423876] [2022-04-08 05:44:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:28,060 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:28,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100658133] [2022-04-08 05:44:28,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:44:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:28,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:28,064 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-08 05:44:28,065 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-08 05:44:28,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:44:28,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:28,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:44:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:28,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:28,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-08 05:44:28,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4797#(<= ~counter~0 0)} {4789#true} #98#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {4797#(<= ~counter~0 0)} call #t~ret8 := main(); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {4797#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,450 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #78#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,450 INFO L272 TraceCheckUtils]: 11: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,451 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #80#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {4797#(<= ~counter~0 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; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,451 INFO L272 TraceCheckUtils]: 17: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,453 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #82#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,453 INFO L272 TraceCheckUtils]: 22: Hoare triple {4797#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {4797#(<= ~counter~0 0)} ~cond := #in~cond; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {4797#(<= ~counter~0 0)} assume !(0 == ~cond); {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {4797#(<= ~counter~0 0)} assume true; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,454 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4797#(<= ~counter~0 0)} {4797#(<= ~counter~0 0)} #84#return; {4797#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:28,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {4797#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:28,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {4876#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {4876#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:28,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {4876#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {4876#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:28,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {4876#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {4886#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,456 INFO L272 TraceCheckUtils]: 32: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,457 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #86#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,458 INFO L272 TraceCheckUtils]: 37: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,459 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #88#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,459 INFO L272 TraceCheckUtils]: 42: Hoare triple {4886#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,461 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #90#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,461 INFO L272 TraceCheckUtils]: 47: Hoare triple {4886#(<= ~counter~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)); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,461 INFO L290 TraceCheckUtils]: 48: Hoare triple {4886#(<= ~counter~0 2)} ~cond := #in~cond; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {4886#(<= ~counter~0 2)} assume !(0 == ~cond); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {4886#(<= ~counter~0 2)} assume true; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,462 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4886#(<= ~counter~0 2)} {4886#(<= ~counter~0 2)} #92#return; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {4886#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {4886#(<= ~counter~0 2)} ~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; {4886#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:28,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {4886#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4959#(<= |main_#t~post6| 2)} is VALID [2022-04-08 05:44:28,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {4959#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {4790#false} is VALID [2022-04-08 05:44:28,464 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-08 05:44:28,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-08 05:44:28,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-08 05:44:28,464 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-08 05:44:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:28,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:28,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {4790#false} assume !false; {4790#false} is VALID [2022-04-08 05:44:28,705 INFO L290 TraceCheckUtils]: 58: Hoare triple {4790#false} assume 0 == ~cond; {4790#false} is VALID [2022-04-08 05:44:28,705 INFO L290 TraceCheckUtils]: 57: Hoare triple {4790#false} ~cond := #in~cond; {4790#false} is VALID [2022-04-08 05:44:28,705 INFO L272 TraceCheckUtils]: 56: Hoare triple {4790#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {4790#false} is VALID [2022-04-08 05:44:28,705 INFO L290 TraceCheckUtils]: 55: Hoare triple {4987#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {4790#false} is VALID [2022-04-08 05:44:28,706 INFO L290 TraceCheckUtils]: 54: Hoare triple {4991#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4987#(< |main_#t~post6| 10)} is VALID [2022-04-08 05:44:28,706 INFO L290 TraceCheckUtils]: 53: Hoare triple {4991#(< ~counter~0 10)} ~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; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,706 INFO L290 TraceCheckUtils]: 52: Hoare triple {4991#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,707 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #92#return; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,708 INFO L290 TraceCheckUtils]: 48: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,708 INFO L272 TraceCheckUtils]: 47: Hoare triple {4991#(< ~counter~0 10)} 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)); {4789#true} is VALID [2022-04-08 05:44:28,709 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #90#return; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,709 INFO L290 TraceCheckUtils]: 45: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,709 INFO L290 TraceCheckUtils]: 44: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,709 INFO L290 TraceCheckUtils]: 43: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,709 INFO L272 TraceCheckUtils]: 42: Hoare triple {4991#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,709 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #88#return; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,710 INFO L272 TraceCheckUtils]: 37: Hoare triple {4991#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,710 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4789#true} {4991#(< ~counter~0 10)} #86#return; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,711 INFO L272 TraceCheckUtils]: 32: Hoare triple {4991#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {4991#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {5064#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4991#(< ~counter~0 10)} is VALID [2022-04-08 05:44:28,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {5064#(< ~counter~0 9)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5064#(< ~counter~0 9)} is VALID [2022-04-08 05:44:28,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {5064#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {5064#(< ~counter~0 9)} is VALID [2022-04-08 05:44:28,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {5074#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5064#(< ~counter~0 9)} is VALID [2022-04-08 05:44:28,715 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #84#return; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,715 INFO L272 TraceCheckUtils]: 22: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,715 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #82#return; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,716 INFO L272 TraceCheckUtils]: 17: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {5074#(< ~counter~0 8)} ~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; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,716 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #80#return; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,716 INFO L272 TraceCheckUtils]: 11: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,717 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4789#true} {5074#(< ~counter~0 8)} #78#return; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {4789#true} assume true; {4789#true} is VALID [2022-04-08 05:44:28,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {4789#true} assume !(0 == ~cond); {4789#true} is VALID [2022-04-08 05:44:28,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {4789#true} ~cond := #in~cond; {4789#true} is VALID [2022-04-08 05:44:28,717 INFO L272 TraceCheckUtils]: 6: Hoare triple {5074#(< ~counter~0 8)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4789#true} is VALID [2022-04-08 05:44:28,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {5074#(< ~counter~0 8)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {5074#(< ~counter~0 8)} call #t~ret8 := main(); {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5074#(< ~counter~0 8)} {4789#true} #98#return; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {5074#(< ~counter~0 8)} assume true; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {4789#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {5074#(< ~counter~0 8)} is VALID [2022-04-08 05:44:28,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {4789#true} call ULTIMATE.init(); {4789#true} is VALID [2022-04-08 05:44:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:28,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671423876] [2022-04-08 05:44:28,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:28,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100658133] [2022-04-08 05:44:28,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100658133] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:28,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:28,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 05:44:28,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:28,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442160394] [2022-04-08 05:44:28,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442160394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:28,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:28,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:44:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967121674] [2022-04-08 05:44:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:28,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-08 05:44:28,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:28,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:28,745 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-08 05:44:28,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:44:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:44:28,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:44:28,746 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:28,938 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-08 05:44:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:44:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 60 [2022-04-08 05:44:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-08 05:44:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-04-08 05:44:28,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2022-04-08 05:44:28,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:28,989 INFO L225 Difference]: With dead ends: 111 [2022-04-08 05:44:28,989 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 05:44:28,990 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:44:28,990 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:28,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 138 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:44:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 05:44:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 05:44:29,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:29,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:29,100 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:29,101 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:29,102 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-08 05:44:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-08 05:44:29,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:29,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:29,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-08 05:44:29,103 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 103 states. [2022-04-08 05:44:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:29,105 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-04-08 05:44:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-08 05:44:29,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:29,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:29,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:29,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 05:44:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2022-04-08 05:44:29,107 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 60 [2022-04-08 05:44:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:29,107 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2022-04-08 05:44:29,108 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:29,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 126 transitions. [2022-04-08 05:44:29,238 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-08 05:44:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2022-04-08 05:44:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-08 05:44:29,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:29,239 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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-08 05:44:29,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 05:44:29,452 WARN L460 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-08 05:44:29,452 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 1 times [2022-04-08 05:44:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:29,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42661510] [2022-04-08 05:44:29,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1088000375, now seen corresponding path program 2 times [2022-04-08 05:44:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:29,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242343216] [2022-04-08 05:44:29,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:29,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:29,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288311674] [2022-04-08 05:44:29,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:44:29,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:29,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:29,464 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-08 05:44:29,465 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-08 05:44:29,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:44:29,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:29,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:44:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:29,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:29,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-08 05:44:29,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {5794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {5794#true} is VALID [2022-04-08 05:44:29,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-08 05:44:29,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-08 05:44:29,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {5794#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5794#true} is VALID [2022-04-08 05:44:29,733 INFO L272 TraceCheckUtils]: 6: Hoare triple {5794#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#true} ~cond := #in~cond; {5820#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:44:29,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {5820#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:44:29,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:44:29,734 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} {5794#true} #78#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-08 05:44:29,734 INFO L272 TraceCheckUtils]: 11: Hoare triple {5831#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,735 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5794#true} {5831#(<= 1 main_~x~0)} #80#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-08 05:44:29,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {5831#(<= 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; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:29,736 INFO L272 TraceCheckUtils]: 17: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,736 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #82#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:29,736 INFO L272 TraceCheckUtils]: 22: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,737 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #84#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:29,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {5850#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:29,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:29,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {5890#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {5890#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,739 INFO L272 TraceCheckUtils]: 32: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,739 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #86#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,739 INFO L272 TraceCheckUtils]: 37: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,740 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #88#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,740 INFO L272 TraceCheckUtils]: 42: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:29,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,741 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,741 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #90#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,741 INFO L272 TraceCheckUtils]: 47: Hoare triple {5890#(<= 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)); {5794#true} is VALID [2022-04-08 05:44:29,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:29,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:29,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:29,742 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #92#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {5890#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:29,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {5890#(<= 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; {5963#(<= 1 main_~b~0)} is VALID [2022-04-08 05:44:29,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {5963#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-08 05:44:29,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {5963#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-08 05:44:29,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-08 05:44:29,744 INFO L272 TraceCheckUtils]: 57: Hoare triple {5795#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5795#false} is VALID [2022-04-08 05:44:29,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-08 05:44:29,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-08 05:44:29,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-08 05:44:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 05:44:29,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:30,022 INFO L290 TraceCheckUtils]: 60: Hoare triple {5795#false} assume !false; {5795#false} is VALID [2022-04-08 05:44:30,022 INFO L290 TraceCheckUtils]: 59: Hoare triple {5795#false} assume 0 == ~cond; {5795#false} is VALID [2022-04-08 05:44:30,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {5795#false} ~cond := #in~cond; {5795#false} is VALID [2022-04-08 05:44:30,022 INFO L272 TraceCheckUtils]: 57: Hoare triple {5795#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {5795#false} is VALID [2022-04-08 05:44:30,022 INFO L290 TraceCheckUtils]: 56: Hoare triple {5963#(<= 1 main_~b~0)} assume !(0 != ~b~0); {5795#false} is VALID [2022-04-08 05:44:30,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {5963#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-08 05:44:30,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {5963#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5963#(<= 1 main_~b~0)} is VALID [2022-04-08 05:44:30,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {5890#(<= 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; {5963#(<= 1 main_~b~0)} is VALID [2022-04-08 05:44:30,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {5890#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,024 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #92#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,024 INFO L272 TraceCheckUtils]: 47: Hoare triple {5890#(<= 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)); {5794#true} is VALID [2022-04-08 05:44:30,025 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #90#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,025 INFO L272 TraceCheckUtils]: 42: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,025 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #88#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L272 TraceCheckUtils]: 37: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5794#true} {5890#(<= 1 main_~c~0)} #86#return; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,026 INFO L290 TraceCheckUtils]: 35: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,026 INFO L272 TraceCheckUtils]: 32: Hoare triple {5890#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {5890#(<= 1 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {5890#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {5890#(<= 1 main_~c~0)} is VALID [2022-04-08 05:44:30,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {5850#(<= 1 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:30,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {5850#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:30,028 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #84#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:30,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,028 INFO L272 TraceCheckUtils]: 22: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,029 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5794#true} {5850#(<= 1 main_~a~0)} #82#return; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:30,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,029 INFO L272 TraceCheckUtils]: 17: Hoare triple {5850#(<= 1 main_~a~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {5831#(<= 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; {5850#(<= 1 main_~a~0)} is VALID [2022-04-08 05:44:30,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5794#true} {5831#(<= 1 main_~x~0)} #80#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-08 05:44:30,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#true} assume !(0 == ~cond); {5794#true} is VALID [2022-04-08 05:44:30,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {5794#true} ~cond := #in~cond; {5794#true} is VALID [2022-04-08 05:44:30,033 INFO L272 TraceCheckUtils]: 11: Hoare triple {5831#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,033 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} {5794#true} #78#return; {5831#(<= 1 main_~x~0)} is VALID [2022-04-08 05:44:30,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {5824#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:44:30,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {6144#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {5824#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:44:30,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#true} ~cond := #in~cond; {6144#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 05:44:30,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {5794#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5794#true} is VALID [2022-04-08 05:44:30,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {5794#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5794#true} is VALID [2022-04-08 05:44:30,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {5794#true} call #t~ret8 := main(); {5794#true} is VALID [2022-04-08 05:44:30,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5794#true} {5794#true} #98#return; {5794#true} is VALID [2022-04-08 05:44:30,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {5794#true} assume true; {5794#true} is VALID [2022-04-08 05:44:30,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {5794#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {5794#true} is VALID [2022-04-08 05:44:30,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {5794#true} call ULTIMATE.init(); {5794#true} is VALID [2022-04-08 05:44:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 05:44:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242343216] [2022-04-08 05:44:30,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:30,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288311674] [2022-04-08 05:44:30,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288311674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:30,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:30,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:44:30,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:30,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42661510] [2022-04-08 05:44:30,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42661510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:30,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:30,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:44:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113852502] [2022-04-08 05:44:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-08 05:44:30,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:30,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 05:44:30,062 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-08 05:44:30,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:44:30,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:44:30,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:44:30,063 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 05:44:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:30,902 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2022-04-08 05:44:30,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 05:44:30,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2022-04-08 05:44:30,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 05:44:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-08 05:44:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 05:44:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 147 transitions. [2022-04-08 05:44:30,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 147 transitions. [2022-04-08 05:44:30,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:31,002 INFO L225 Difference]: With dead ends: 182 [2022-04-08 05:44:31,003 INFO L226 Difference]: Without dead ends: 174 [2022-04-08 05:44:31,003 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-08 05:44:31,003 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 59 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:31,003 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 317 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 05:44:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-08 05:44:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2022-04-08 05:44:31,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:31,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:31,187 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:31,187 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:31,193 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-08 05:44:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-08 05:44:31,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:31,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:31,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-08 05:44:31,194 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 174 states. [2022-04-08 05:44:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:31,198 INFO L93 Difference]: Finished difference Result 174 states and 246 transitions. [2022-04-08 05:44:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2022-04-08 05:44:31,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:31,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:31,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:31,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 94 states have internal predecessors, (115), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2022-04-08 05:44:31,202 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 61 [2022-04-08 05:44:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:31,202 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2022-04-08 05:44:31,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 05:44:31,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 199 transitions. [2022-04-08 05:44:31,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2022-04-08 05:44:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 05:44:31,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:31,433 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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, 1] [2022-04-08 05:44:31,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 05:44:31,633 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 05:44:31,633 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 1 times [2022-04-08 05:44:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:31,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335417522] [2022-04-08 05:44:31,634 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1537891564, now seen corresponding path program 2 times [2022-04-08 05:44:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:31,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810840634] [2022-04-08 05:44:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:31,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:31,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:31,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487182736] [2022-04-08 05:44:31,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:44:31,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:31,663 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-08 05:44:31,679 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-08 05:44:31,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:44:31,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:31,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 05:44:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:31,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:31,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-08 05:44:31,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {7186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7194#(<= ~counter~0 0)} {7186#true} #98#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {7194#(<= ~counter~0 0)} call #t~ret8 := main(); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {7194#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,959 INFO L272 TraceCheckUtils]: 6: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #78#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,982 INFO L272 TraceCheckUtils]: 11: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,983 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #80#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {7194#(<= ~counter~0 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; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,983 INFO L272 TraceCheckUtils]: 17: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,985 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #82#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,985 INFO L272 TraceCheckUtils]: 22: Hoare triple {7194#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {7194#(<= ~counter~0 0)} ~cond := #in~cond; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {7194#(<= ~counter~0 0)} assume !(0 == ~cond); {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {7194#(<= ~counter~0 0)} assume true; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,986 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7194#(<= ~counter~0 0)} {7194#(<= ~counter~0 0)} #84#return; {7194#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:31,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {7194#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7273#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:31,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {7273#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {7273#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:31,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {7273#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7273#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:31,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {7273#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {7283#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,988 INFO L272 TraceCheckUtils]: 32: Hoare triple {7283#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,989 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #86#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,990 INFO L272 TraceCheckUtils]: 37: Hoare triple {7283#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,991 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #88#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,991 INFO L272 TraceCheckUtils]: 42: Hoare triple {7283#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,993 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #90#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,993 INFO L272 TraceCheckUtils]: 47: Hoare triple {7283#(<= ~counter~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)); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {7283#(<= ~counter~0 2)} ~cond := #in~cond; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {7283#(<= ~counter~0 2)} assume !(0 == ~cond); {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {7283#(<= ~counter~0 2)} assume true; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,994 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7283#(<= ~counter~0 2)} {7283#(<= ~counter~0 2)} #92#return; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,995 INFO L290 TraceCheckUtils]: 52: Hoare triple {7283#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7283#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:31,995 INFO L290 TraceCheckUtils]: 53: Hoare triple {7283#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7353#(<= |main_#t~post7| 2)} is VALID [2022-04-08 05:44:31,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {7353#(<= |main_#t~post7| 2)} assume !(#t~post7 < 10);havoc #t~post7; {7187#false} is VALID [2022-04-08 05:44:31,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {7187#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; {7187#false} is VALID [2022-04-08 05:44:31,996 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-08 05:44:31,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-08 05:44:31,996 INFO L272 TraceCheckUtils]: 58: Hoare triple {7187#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7187#false} is VALID [2022-04-08 05:44:31,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-08 05:44:31,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-08 05:44:31,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-08 05:44:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:31,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:32,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {7187#false} assume !false; {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {7187#false} assume 0 == ~cond; {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L290 TraceCheckUtils]: 59: Hoare triple {7187#false} ~cond := #in~cond; {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L272 TraceCheckUtils]: 58: Hoare triple {7187#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {7187#false} assume !(#t~post6 < 10);havoc #t~post6; {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {7187#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L290 TraceCheckUtils]: 55: Hoare triple {7187#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; {7187#false} is VALID [2022-04-08 05:44:32,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {7399#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {7187#false} is VALID [2022-04-08 05:44:32,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {7403#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7399#(< |main_#t~post7| 10)} is VALID [2022-04-08 05:44:32,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {7403#(< ~counter~0 10)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,264 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #92#return; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,264 INFO L290 TraceCheckUtils]: 48: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,264 INFO L272 TraceCheckUtils]: 47: Hoare triple {7403#(< ~counter~0 10)} 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)); {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #90#return; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L272 TraceCheckUtils]: 42: Hoare triple {7403#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #88#return; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,265 INFO L272 TraceCheckUtils]: 37: Hoare triple {7403#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,266 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7186#true} {7403#(< ~counter~0 10)} #86#return; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,266 INFO L272 TraceCheckUtils]: 32: Hoare triple {7403#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {7403#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {7473#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7403#(< ~counter~0 10)} is VALID [2022-04-08 05:44:32,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {7473#(< ~counter~0 9)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {7473#(< ~counter~0 9)} is VALID [2022-04-08 05:44:32,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {7473#(< ~counter~0 9)} assume !!(#t~post6 < 10);havoc #t~post6; {7473#(< ~counter~0 9)} is VALID [2022-04-08 05:44:32,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {7483#(< ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7473#(< ~counter~0 9)} is VALID [2022-04-08 05:44:32,268 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #84#return; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,268 INFO L272 TraceCheckUtils]: 22: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,272 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #82#return; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,272 INFO L272 TraceCheckUtils]: 17: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {7483#(< ~counter~0 8)} ~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; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,273 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #80#return; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,273 INFO L272 TraceCheckUtils]: 11: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,273 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7186#true} {7483#(< ~counter~0 8)} #78#return; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {7186#true} assume true; {7186#true} is VALID [2022-04-08 05:44:32,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {7186#true} assume !(0 == ~cond); {7186#true} is VALID [2022-04-08 05:44:32,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {7186#true} ~cond := #in~cond; {7186#true} is VALID [2022-04-08 05:44:32,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {7483#(< ~counter~0 8)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7186#true} is VALID [2022-04-08 05:44:32,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {7483#(< ~counter~0 8)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {7483#(< ~counter~0 8)} call #t~ret8 := main(); {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7483#(< ~counter~0 8)} {7186#true} #98#return; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {7483#(< ~counter~0 8)} assume true; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {7186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {7483#(< ~counter~0 8)} is VALID [2022-04-08 05:44:32,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {7186#true} call ULTIMATE.init(); {7186#true} is VALID [2022-04-08 05:44:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:32,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810840634] [2022-04-08 05:44:32,275 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:32,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487182736] [2022-04-08 05:44:32,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487182736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:32,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:32,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 05:44:32,276 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:32,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335417522] [2022-04-08 05:44:32,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335417522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:32,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:32,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 05:44:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760081633] [2022-04-08 05:44:32,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:32,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 05:44:32,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:32,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:32,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:32,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 05:44:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 05:44:32,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:44:32,306 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:32,654 INFO L93 Difference]: Finished difference Result 183 states and 250 transitions. [2022-04-08 05:44:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:44:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 05:44:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-08 05:44:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-04-08 05:44:32,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2022-04-08 05:44:32,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:32,721 INFO L225 Difference]: With dead ends: 183 [2022-04-08 05:44:32,721 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 05:44:32,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-08 05:44:32,722 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:32,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 143 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:44:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 05:44:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 05:44:32,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:32,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:32,925 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:32,926 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:32,929 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-08 05:44:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-08 05:44:32,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:32,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:32,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-08 05:44:32,930 INFO L87 Difference]: Start difference. First operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) Second operand 146 states. [2022-04-08 05:44:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:32,933 INFO L93 Difference]: Finished difference Result 146 states and 198 transitions. [2022-04-08 05:44:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-08 05:44:32,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:32,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:32,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:32,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 94 states have internal predecessors, (114), 43 states have call successors, (43), 13 states have call predecessors, (43), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-08 05:44:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 198 transitions. [2022-04-08 05:44:32,937 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 198 transitions. Word has length 62 [2022-04-08 05:44:32,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:32,937 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 198 transitions. [2022-04-08 05:44:32,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:32,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 198 transitions. [2022-04-08 05:44:33,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 198 transitions. [2022-04-08 05:44:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-08 05:44:33,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:33,147 INFO L499 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1] [2022-04-08 05:44:33,180 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-08 05:44:33,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 05:44:33,348 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:33,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:33,348 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 1 times [2022-04-08 05:44:33,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:33,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032329251] [2022-04-08 05:44:33,349 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash -385934262, now seen corresponding path program 2 times [2022-04-08 05:44:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:33,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821065032] [2022-04-08 05:44:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:33,358 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:33,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [716508070] [2022-04-08 05:44:33,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:44:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:33,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:33,359 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-08 05:44:33,370 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-08 05:44:33,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:44:33,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:33,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 05:44:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:33,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:33,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 05:44:33,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8527#(<= ~counter~0 0)} {8519#true} #98#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {8527#(<= ~counter~0 0)} call #t~ret8 := main(); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {8527#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,718 INFO L272 TraceCheckUtils]: 6: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,719 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #78#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,720 INFO L272 TraceCheckUtils]: 11: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,721 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #80#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {8527#(<= ~counter~0 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; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,722 INFO L272 TraceCheckUtils]: 17: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,724 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #82#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,724 INFO L272 TraceCheckUtils]: 22: Hoare triple {8527#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {8527#(<= ~counter~0 0)} ~cond := #in~cond; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {8527#(<= ~counter~0 0)} assume !(0 == ~cond); {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {8527#(<= ~counter~0 0)} assume true; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,725 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8527#(<= ~counter~0 0)} {8527#(<= ~counter~0 0)} #84#return; {8527#(<= ~counter~0 0)} is VALID [2022-04-08 05:44:33,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {8527#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8606#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:33,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {8606#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {8606#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:33,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {8606#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8606#(<= ~counter~0 1)} is VALID [2022-04-08 05:44:33,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {8606#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {8616#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {8616#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,729 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #86#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,730 INFO L272 TraceCheckUtils]: 37: Hoare triple {8616#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,731 INFO L290 TraceCheckUtils]: 40: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,731 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #88#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,732 INFO L272 TraceCheckUtils]: 42: Hoare triple {8616#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,733 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #90#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,734 INFO L272 TraceCheckUtils]: 47: Hoare triple {8616#(<= ~counter~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)); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,734 INFO L290 TraceCheckUtils]: 48: Hoare triple {8616#(<= ~counter~0 2)} ~cond := #in~cond; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {8616#(<= ~counter~0 2)} assume !(0 == ~cond); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {8616#(<= ~counter~0 2)} assume true; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,736 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8616#(<= ~counter~0 2)} {8616#(<= ~counter~0 2)} #92#return; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {8616#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {8616#(<= ~counter~0 2)} ~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; {8616#(<= ~counter~0 2)} is VALID [2022-04-08 05:44:33,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {8616#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8689#(<= ~counter~0 3)} is VALID [2022-04-08 05:44:33,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {8689#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {8689#(<= ~counter~0 3)} is VALID [2022-04-08 05:44:33,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {8689#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8689#(<= ~counter~0 3)} is VALID [2022-04-08 05:44:33,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {8689#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8699#(<= |main_#t~post7| 3)} is VALID [2022-04-08 05:44:33,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {8699#(<= |main_#t~post7| 3)} assume !(#t~post7 < 10);havoc #t~post7; {8520#false} is VALID [2022-04-08 05:44:33,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {8520#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; {8520#false} is VALID [2022-04-08 05:44:33,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-08 05:44:33,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-08 05:44:33,738 INFO L272 TraceCheckUtils]: 62: Hoare triple {8520#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8520#false} is VALID [2022-04-08 05:44:33,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 05:44:33,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 05:44:33,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 05:44:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:33,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:34,053 INFO L290 TraceCheckUtils]: 65: Hoare triple {8520#false} assume !false; {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {8520#false} assume 0 == ~cond; {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {8520#false} ~cond := #in~cond; {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L272 TraceCheckUtils]: 62: Hoare triple {8520#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {8520#false} assume !(#t~post6 < 10);havoc #t~post6; {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {8520#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {8520#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; {8520#false} is VALID [2022-04-08 05:44:34,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {8745#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {8520#false} is VALID [2022-04-08 05:44:34,055 INFO L290 TraceCheckUtils]: 57: Hoare triple {8749#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8745#(< |main_#t~post7| 10)} is VALID [2022-04-08 05:44:34,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {8749#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8749#(< ~counter~0 10)} is VALID [2022-04-08 05:44:34,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {8749#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {8749#(< ~counter~0 10)} is VALID [2022-04-08 05:44:34,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {8759#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8749#(< ~counter~0 10)} is VALID [2022-04-08 05:44:34,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {8759#(< ~counter~0 9)} ~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; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {8759#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,061 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #92#return; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,061 INFO L290 TraceCheckUtils]: 49: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,061 INFO L290 TraceCheckUtils]: 48: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,061 INFO L272 TraceCheckUtils]: 47: Hoare triple {8759#(< ~counter~0 9)} 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)); {8519#true} is VALID [2022-04-08 05:44:34,062 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #90#return; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,062 INFO L290 TraceCheckUtils]: 45: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,062 INFO L272 TraceCheckUtils]: 42: Hoare triple {8759#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,063 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #88#return; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,063 INFO L272 TraceCheckUtils]: 37: Hoare triple {8759#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,064 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8519#true} {8759#(< ~counter~0 9)} #86#return; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,064 INFO L272 TraceCheckUtils]: 32: Hoare triple {8759#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {8759#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {8832#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8759#(< ~counter~0 9)} is VALID [2022-04-08 05:44:34,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {8832#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {8832#(< ~counter~0 8)} is VALID [2022-04-08 05:44:34,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {8832#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {8832#(< ~counter~0 8)} is VALID [2022-04-08 05:44:34,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {8842#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8832#(< ~counter~0 8)} is VALID [2022-04-08 05:44:34,066 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #84#return; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L272 TraceCheckUtils]: 22: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #82#return; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,067 INFO L272 TraceCheckUtils]: 17: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {8842#(< ~counter~0 7)} ~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; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,068 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #80#return; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8519#true} {8842#(< ~counter~0 7)} #78#return; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {8519#true} assume true; {8519#true} is VALID [2022-04-08 05:44:34,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {8519#true} assume !(0 == ~cond); {8519#true} is VALID [2022-04-08 05:44:34,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {8519#true} ~cond := #in~cond; {8519#true} is VALID [2022-04-08 05:44:34,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {8842#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {8519#true} is VALID [2022-04-08 05:44:34,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {8842#(< ~counter~0 7)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {8842#(< ~counter~0 7)} call #t~ret8 := main(); {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8842#(< ~counter~0 7)} {8519#true} #98#return; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {8842#(< ~counter~0 7)} assume true; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {8519#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {8842#(< ~counter~0 7)} is VALID [2022-04-08 05:44:34,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {8519#true} call ULTIMATE.init(); {8519#true} is VALID [2022-04-08 05:44:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 05:44:34,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821065032] [2022-04-08 05:44:34,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716508070] [2022-04-08 05:44:34,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716508070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:34,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:34,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 05:44:34,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:34,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032329251] [2022-04-08 05:44:34,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032329251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:34,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:34,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:44:34,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330616796] [2022-04-08 05:44:34,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-08 05:44:34,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:34,094 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), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:34,131 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-08 05:44:34,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:44:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:44:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:44:34,132 INFO L87 Difference]: Start difference. First operand 146 states and 198 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:34,575 INFO L93 Difference]: Finished difference Result 253 states and 351 transitions. [2022-04-08 05:44:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:44:34,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-08 05:44:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 05:44:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 05:44:34,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-08 05:44:34,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:34,660 INFO L225 Difference]: With dead ends: 253 [2022-04-08 05:44:34,660 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 05:44:34,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:44:34,661 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:34,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 155 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:44:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 05:44:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2022-04-08 05:44:34,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:34,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:44:34,915 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:44:34,915 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:44:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:34,920 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-08 05:44:34,920 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-08 05:44:34,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:34,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:34,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-08 05:44:34,922 INFO L87 Difference]: Start difference. First operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand 173 states. [2022-04-08 05:44:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:34,926 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-04-08 05:44:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 225 transitions. [2022-04-08 05:44:34,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:34,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:34,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:34,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 111 states have internal predecessors, (133), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 05:44:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2022-04-08 05:44:34,931 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 66 [2022-04-08 05:44:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:34,931 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2022-04-08 05:44:34,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 05:44:34,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 223 transitions. [2022-04-08 05:44:35,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2022-04-08 05:44:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 05:44:35,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:35,177 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 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] [2022-04-08 05:44:35,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 05:44:35,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 05:44:35,377 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 1 times [2022-04-08 05:44:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:35,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705499879] [2022-04-08 05:44:35,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash 792554045, now seen corresponding path program 2 times [2022-04-08 05:44:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:35,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503187669] [2022-04-08 05:44:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:35,389 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:35,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004581084] [2022-04-08 05:44:35,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:44:35,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:35,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:35,392 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-08 05:44:35,392 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-08 05:44:35,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:44:35,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:35,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 05:44:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:35,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:35,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L272 TraceCheckUtils]: 6: Hoare triple {10124#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L272 TraceCheckUtils]: 11: Hoare triple {10124#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-08 05:44:35,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#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; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:44:35,778 INFO L272 TraceCheckUtils]: 17: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:35,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,780 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10124#true} {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:44:35,780 INFO L272 TraceCheckUtils]: 22: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:35,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,780 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10124#true} {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:44:35,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:44:35,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:44:35,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {10177#(and (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,782 INFO L272 TraceCheckUtils]: 32: Hoare triple {10217#(and (= 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)); {10124#true} is VALID [2022-04-08 05:44:35,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,782 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,782 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10124#true} {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,783 INFO L272 TraceCheckUtils]: 37: Hoare triple {10217#(and (= 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)); {10124#true} is VALID [2022-04-08 05:44:35,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,783 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10124#true} {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,783 INFO L272 TraceCheckUtils]: 42: Hoare triple {10217#(and (= 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)); {10124#true} is VALID [2022-04-08 05:44:35,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#true} ~cond := #in~cond; {10260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:35,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {10260#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:44:35,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:44:35,785 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} {10217#(and (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,785 INFO L272 TraceCheckUtils]: 47: Hoare triple {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {10124#true} is VALID [2022-04-08 05:44:35,785 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,785 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,785 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10124#true} {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:44:35,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {10271#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post6 < 10);havoc #t~post6; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,787 INFO L290 TraceCheckUtils]: 56: Hoare triple {10293#(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; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,787 INFO L290 TraceCheckUtils]: 57: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,788 INFO L290 TraceCheckUtils]: 58: Hoare triple {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,788 INFO L272 TraceCheckUtils]: 59: Hoare triple {10293#(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)); {10124#true} is VALID [2022-04-08 05:44:35,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:35,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:35,788 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:35,789 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10124#true} {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #86#return; {10293#(and (= main_~p~0 0) (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-08 05:44:35,789 INFO L272 TraceCheckUtils]: 64: Hoare triple {10293#(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)); {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:35,789 INFO L290 TraceCheckUtils]: 65: Hoare triple {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:35,790 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-08 05:44:35,790 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-08 05:44:35,790 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 05:44:35,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:48,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {10125#false} assume !false; {10125#false} is VALID [2022-04-08 05:44:48,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {10331#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10125#false} is VALID [2022-04-08 05:44:48,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10331#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:48,997 INFO L272 TraceCheckUtils]: 64: Hoare triple {10347#(= 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)); {10327#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:48,997 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {10124#true} {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:48,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:48,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:48,997 INFO L290 TraceCheckUtils]: 60: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:48,998 INFO L272 TraceCheckUtils]: 59: Hoare triple {10347#(= 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)); {10124#true} is VALID [2022-04-08 05:44:48,998 INFO L290 TraceCheckUtils]: 58: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:48,998 INFO L290 TraceCheckUtils]: 57: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:48,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {10347#(= 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; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:48,999 INFO L290 TraceCheckUtils]: 55: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:48,999 INFO L290 TraceCheckUtils]: 54: Hoare triple {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:49,000 INFO L290 TraceCheckUtils]: 53: Hoare triple {10381#(= 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; {10347#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:44:49,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:49,001 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {10124#true} {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:49,001 INFO L290 TraceCheckUtils]: 50: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,001 INFO L290 TraceCheckUtils]: 49: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,001 INFO L290 TraceCheckUtils]: 48: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,001 INFO L272 TraceCheckUtils]: 47: Hoare triple {10381#(= 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)); {10124#true} is VALID [2022-04-08 05:44:49,002 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} {10124#true} #90#return; {10381#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:49,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:44:49,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {10412#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10264#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:44:49,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {10124#true} ~cond := #in~cond; {10412#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:44:49,012 INFO L272 TraceCheckUtils]: 42: Hoare triple {10124#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,012 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10124#true} {10124#true} #88#return; {10124#true} is VALID [2022-04-08 05:44:49,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,012 INFO L272 TraceCheckUtils]: 37: Hoare triple {10124#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10124#true} {10124#true} #86#return; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {10124#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {10124#true} assume !!(#t~post7 < 10);havoc #t~post7; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {10124#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {10124#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {10124#true} assume !!(#t~post6 < 10);havoc #t~post6; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {10124#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {10124#true} {10124#true} #84#return; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,013 INFO L272 TraceCheckUtils]: 22: Hoare triple {10124#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10124#true} {10124#true} #82#return; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L272 TraceCheckUtils]: 17: Hoare triple {10124#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {10124#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; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10124#true} {10124#true} #80#return; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L272 TraceCheckUtils]: 11: Hoare triple {10124#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10124#true} {10124#true} #78#return; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {10124#true} assume !(0 == ~cond); {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {10124#true} ~cond := #in~cond; {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {10124#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {10124#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {10124#true} call #t~ret8 := main(); {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10124#true} {10124#true} #98#return; {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {10124#true} assume true; {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {10124#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {10124#true} call ULTIMATE.init(); {10124#true} is VALID [2022-04-08 05:44:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-08 05:44:49,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:49,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503187669] [2022-04-08 05:44:49,016 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:49,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004581084] [2022-04-08 05:44:49,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004581084] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:49,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:49,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2022-04-08 05:44:49,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:49,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705499879] [2022-04-08 05:44:49,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705499879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:49,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:49,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 05:44:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144402828] [2022-04-08 05:44:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:49,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-08 05:44:49,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:49,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 05:44:49,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:49,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 05:44:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 05:44:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-04-08 05:44:49,053 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 05:44:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:50,159 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2022-04-08 05:44:50,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 05:44:50,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-08 05:44:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 05:44:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-08 05:44:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 05:44:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 97 transitions. [2022-04-08 05:44:50,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 97 transitions. [2022-04-08 05:44:50,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:50,263 INFO L225 Difference]: With dead ends: 195 [2022-04-08 05:44:50,264 INFO L226 Difference]: Without dead ends: 193 [2022-04-08 05:44:50,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-08 05:44:50,264 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:50,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 295 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 05:44:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-04-08 05:44:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-04-08 05:44:50,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:50,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:50,539 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:50,539 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:50,543 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-08 05:44:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-08 05:44:50,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:50,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:50,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-08 05:44:50,548 INFO L87 Difference]: Start difference. First operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 193 states. [2022-04-08 05:44:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:50,555 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2022-04-08 05:44:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2022-04-08 05:44:50,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:50,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:50,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:50,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 117 states have (on average 1.2478632478632479) internal successors, (146), 121 states have internal predecessors, (146), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2022-04-08 05:44:50,561 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 68 [2022-04-08 05:44:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:50,561 INFO L478 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2022-04-08 05:44:50,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-08 05:44:50,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 190 states and 254 transitions. [2022-04-08 05:44:50,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2022-04-08 05:44:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 05:44:50,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:50,842 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 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] [2022-04-08 05:44:50,860 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-08 05:44:51,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 05:44:51,042 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 3 times [2022-04-08 05:44:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:51,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319174532] [2022-04-08 05:44:51,043 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 783638790, now seen corresponding path program 4 times [2022-04-08 05:44:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:51,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486236246] [2022-04-08 05:44:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:51,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:51,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584203686] [2022-04-08 05:44:51,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:44:51,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:51,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:51,060 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-08 05:44:51,061 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-08 05:44:51,105 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:44:51,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:51,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 05:44:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:51,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:51,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-08 05:44:51,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {11708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {11708#true} is VALID [2022-04-08 05:44:51,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-08 05:44:51,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-08 05:44:51,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {11708#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {11708#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L272 TraceCheckUtils]: 11: Hoare triple {11708#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,389 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-08 05:44:51,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {11708#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; {11761#(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-08 05:44:51,390 INFO L272 TraceCheckUtils]: 17: Hoare triple {11761#(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)); {11708#true} is VALID [2022-04-08 05:44:51,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,390 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11708#true} {11761#(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))} #82#return; {11761#(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-08 05:44:51,390 INFO L272 TraceCheckUtils]: 22: Hoare triple {11761#(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)); {11708#true} is VALID [2022-04-08 05:44:51,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,391 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11708#true} {11761#(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))} #84#return; {11761#(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-08 05:44:51,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {11761#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11761#(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-08 05:44:51,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {11761#(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 !!(#t~post6 < 10);havoc #t~post6; {11761#(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-08 05:44:51,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {11761#(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; {11801#(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-08 05:44:51,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {11801#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11801#(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-08 05:44:51,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {11801#(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 !!(#t~post7 < 10);havoc #t~post7; {11801#(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-08 05:44:51,393 INFO L272 TraceCheckUtils]: 32: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-08 05:44:51,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11708#true} {11801#(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))} #86#return; {11801#(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-08 05:44:51,394 INFO L272 TraceCheckUtils]: 37: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11708#true} {11801#(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))} #88#return; {11801#(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-08 05:44:51,394 INFO L272 TraceCheckUtils]: 42: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,395 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,395 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11708#true} {11801#(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))} #90#return; {11801#(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-08 05:44:51,395 INFO L272 TraceCheckUtils]: 47: Hoare triple {11801#(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)); {11708#true} is VALID [2022-04-08 05:44:51,395 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,395 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,395 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,396 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11708#true} {11801#(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))} #92#return; {11801#(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-08 05:44:51,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {11801#(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); {11801#(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-08 05:44:51,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {11801#(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))} ~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; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,397 INFO L290 TraceCheckUtils]: 55: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,397 INFO L290 TraceCheckUtils]: 56: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,398 INFO L272 TraceCheckUtils]: 59: Hoare triple {11874#(and (= main_~s~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)); {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11708#true} {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #86#return; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,398 INFO L272 TraceCheckUtils]: 64: Hoare triple {11874#(and (= main_~s~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)); {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,399 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11708#true} {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #88#return; {11874#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-08 05:44:51,399 INFO L272 TraceCheckUtils]: 69: Hoare triple {11874#(and (= main_~s~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)); {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:51,399 INFO L290 TraceCheckUtils]: 70: Hoare triple {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:51,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-08 05:44:51,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-08 05:44:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 05:44:51,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:44:51,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {11709#false} assume !false; {11709#false} is VALID [2022-04-08 05:44:51,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {11927#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11709#false} is VALID [2022-04-08 05:44:51,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11927#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:51,596 INFO L272 TraceCheckUtils]: 69: Hoare triple {11943#(= 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)); {11923#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:51,597 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {11708#true} {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:51,597 INFO L290 TraceCheckUtils]: 67: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,597 INFO L272 TraceCheckUtils]: 64: Hoare triple {11943#(= 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)); {11708#true} is VALID [2022-04-08 05:44:51,597 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11708#true} {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:51,597 INFO L290 TraceCheckUtils]: 62: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:51,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:51,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:51,598 INFO L272 TraceCheckUtils]: 59: Hoare triple {11943#(= 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)); {11708#true} is VALID [2022-04-08 05:44:51,598 INFO L290 TraceCheckUtils]: 58: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:51,598 INFO L290 TraceCheckUtils]: 57: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:51,598 INFO L290 TraceCheckUtils]: 56: Hoare triple {11943#(= 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; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:51,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:51,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:44:53,600 WARN L290 TraceCheckUtils]: 53: Hoare triple {11992#(= (+ (* 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)))} ~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; {11943#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-08 05:44:53,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {11992#(= (+ (* 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)))} assume !(~c~0 >= ~b~0); {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,601 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {11708#true} {11992#(= (+ (* 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)))} #92#return; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,602 INFO L272 TraceCheckUtils]: 47: Hoare triple {11992#(= (+ (* 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)))} 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)); {11708#true} is VALID [2022-04-08 05:44:53,602 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11708#true} {11992#(= (+ (* 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)))} #90#return; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,603 INFO L272 TraceCheckUtils]: 42: Hoare triple {11992#(= (+ (* 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)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,603 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11708#true} {11992#(= (+ (* 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)))} #88#return; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,603 INFO L272 TraceCheckUtils]: 37: Hoare triple {11992#(= (+ (* 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)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,604 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11708#true} {11992#(= (+ (* 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)))} #86#return; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,605 INFO L272 TraceCheckUtils]: 32: Hoare triple {11992#(= (+ (* 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)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {11992#(= (+ (* 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)))} assume !!(#t~post7 < 10);havoc #t~post7; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {11992#(= (+ (* 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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {11992#(= (+ (* 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)))} is VALID [2022-04-08 05:44:53,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-08 05:44:53,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-08 05:44:53,607 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {11708#true} {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #84#return; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-08 05:44:53,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,608 INFO L272 TraceCheckUtils]: 22: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,608 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {11708#true} {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} #82#return; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-08 05:44:53,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L272 TraceCheckUtils]: 17: Hoare triple {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {11708#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; {12065#(= (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0 0) main_~a~0 (* main_~y~0 main_~s~0 0)))} is VALID [2022-04-08 05:44:53,609 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11708#true} {11708#true} #80#return; {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L272 TraceCheckUtils]: 11: Hoare triple {11708#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11708#true} {11708#true} #78#return; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {11708#true} assume !(0 == ~cond); {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {11708#true} ~cond := #in~cond; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {11708#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {11708#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {11708#true} call #t~ret8 := main(); {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11708#true} {11708#true} #98#return; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {11708#true} assume true; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {11708#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {11708#true} call ULTIMATE.init(); {11708#true} is VALID [2022-04-08 05:44:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 05:44:53,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:44:53,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486236246] [2022-04-08 05:44:53,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:44:53,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584203686] [2022-04-08 05:44:53,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584203686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:44:53,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:44:53,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 05:44:53,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:44:53,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319174532] [2022-04-08 05:44:53,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319174532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:44:53,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:44:53,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:44:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683280502] [2022-04-08 05:44:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:44:53,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-08 05:44:53,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:44:53,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:44:53,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:53,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:44:53,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:53,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:44:53,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:44:53,653 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:44:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:54,398 INFO L93 Difference]: Finished difference Result 199 states and 262 transitions. [2022-04-08 05:44:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:44:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 73 [2022-04-08 05:44:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:44:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:44:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-08 05:44:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:44:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-08 05:44:54,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-08 05:44:54,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:54,483 INFO L225 Difference]: With dead ends: 199 [2022-04-08 05:44:54,484 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 05:44:54,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:44:54,484 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 17 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 05:44:54,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 234 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 05:44:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 05:44:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2022-04-08 05:44:54,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:44:54,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:54,757 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:54,758 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:54,762 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-08 05:44:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-08 05:44:54,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:54,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:54,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-08 05:44:54,763 INFO L87 Difference]: Start difference. First operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 197 states. [2022-04-08 05:44:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:44:54,767 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2022-04-08 05:44:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2022-04-08 05:44:54,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:44:54,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:44:54,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:44:54,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:44:54,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 120 states have (on average 1.2416666666666667) internal successors, (149), 124 states have internal predecessors, (149), 55 states have call successors, (55), 19 states have call predecessors, (55), 18 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:44:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 257 transitions. [2022-04-08 05:44:54,772 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 257 transitions. Word has length 73 [2022-04-08 05:44:54,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:44:54,772 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 257 transitions. [2022-04-08 05:44:54,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-04-08 05:44:54,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 257 transitions. [2022-04-08 05:44:55,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:44:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 257 transitions. [2022-04-08 05:44:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 05:44:55,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:44:55,069 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 2, 2, 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] [2022-04-08 05:44:55,085 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-08 05:44:55,269 WARN L460 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-08 05:44:55,269 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:44:55,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:44:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 5 times [2022-04-08 05:44:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:44:55,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484785318] [2022-04-08 05:44:55,270 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:44:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1625446301, now seen corresponding path program 6 times [2022-04-08 05:44:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:44:55,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864470681] [2022-04-08 05:44:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:44:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:44:55,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:44:55,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2043782248] [2022-04-08 05:44:55,280 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:44:55,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:44:55,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:44:55,282 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-08 05:44:55,283 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-08 05:44:55,334 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:44:55,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:44:55,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 05:44:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:44:55,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:44:57,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {13339#true} call ULTIMATE.init(); {13339#true} is VALID [2022-04-08 05:44:57,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {13339#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {13339#true} is VALID [2022-04-08 05:44:57,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13339#true} {13339#true} #98#return; {13339#true} is VALID [2022-04-08 05:44:57,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {13339#true} call #t~ret8 := main(); {13339#true} is VALID [2022-04-08 05:44:57,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {13339#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13339#true} is VALID [2022-04-08 05:44:57,395 INFO L272 TraceCheckUtils]: 6: Hoare triple {13339#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {13339#true} is VALID [2022-04-08 05:44:57,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {13339#true} ~cond := #in~cond; {13365#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:44:57,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {13365#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {13369#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:44:57,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {13369#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {13369#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:44:57,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13369#(not (= |assume_abort_if_not_#in~cond| 0))} {13339#true} #78#return; {13376#(<= 1 main_~x~0)} is VALID [2022-04-08 05:44:57,396 INFO L272 TraceCheckUtils]: 11: Hoare triple {13376#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13339#true} is VALID [2022-04-08 05:44:57,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13339#true} {13376#(<= 1 main_~x~0)} #80#return; {13376#(<= 1 main_~x~0)} is VALID [2022-04-08 05:44:57,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {13376#(<= 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; {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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-08 05:44:57,397 INFO L272 TraceCheckUtils]: 17: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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)); {13339#true} is VALID [2022-04-08 05:44:57,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,398 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13339#true} {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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))} #82#return; {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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-08 05:44:57,398 INFO L272 TraceCheckUtils]: 22: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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)); {13339#true} is VALID [2022-04-08 05:44:57,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,399 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {13339#true} {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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))} #84#return; {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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-08 05:44:57,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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-08 05:44:57,400 INFO L290 TraceCheckUtils]: 28: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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 !!(#t~post6 < 10);havoc #t~post6; {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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-08 05:44:57,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {13395#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~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; {13435#(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 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-08 05:44:57,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {13435#(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 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13435#(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 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-08 05:44:57,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {13435#(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 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 !!(#t~post7 < 10);havoc #t~post7; {13435#(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 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-08 05:44:57,401 INFO L272 TraceCheckUtils]: 32: Hoare triple {13435#(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 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)); {13339#true} is VALID [2022-04-08 05:44:57,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,402 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13339#true} {13435#(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 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #86#return; {13435#(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 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-08 05:44:57,402 INFO L272 TraceCheckUtils]: 37: Hoare triple {13435#(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 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)); {13339#true} is VALID [2022-04-08 05:44:57,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,403 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13339#true} {13435#(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 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #88#return; {13435#(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 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-08 05:44:57,403 INFO L272 TraceCheckUtils]: 42: Hoare triple {13435#(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 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)); {13339#true} is VALID [2022-04-08 05:44:57,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,404 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13339#true} {13435#(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 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #90#return; {13435#(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 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-08 05:44:57,404 INFO L272 TraceCheckUtils]: 47: Hoare triple {13435#(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 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)); {13339#true} is VALID [2022-04-08 05:44:57,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,404 INFO L290 TraceCheckUtils]: 49: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,405 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {13339#true} {13435#(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 0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #92#return; {13435#(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 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-08 05:44:57,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {13435#(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 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); {13505#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~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) (= main_~p~0 1))} is VALID [2022-04-08 05:44:57,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {13505#(and (= main_~r~0 0) (<= 1 main_~x~0) (< main_~c~0 main_~y~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) (= 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; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,408 INFO L290 TraceCheckUtils]: 56: Hoare triple {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,408 INFO L290 TraceCheckUtils]: 57: Hoare triple {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,408 INFO L290 TraceCheckUtils]: 58: Hoare triple {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,408 INFO L272 TraceCheckUtils]: 59: Hoare triple {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {13339#true} is VALID [2022-04-08 05:44:57,409 INFO L290 TraceCheckUtils]: 60: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,409 INFO L290 TraceCheckUtils]: 61: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,409 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13339#true} {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,409 INFO L272 TraceCheckUtils]: 64: Hoare triple {13509#(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_~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)); {13339#true} is VALID [2022-04-08 05:44:57,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {13339#true} ~cond := #in~cond; {13339#true} is VALID [2022-04-08 05:44:57,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {13339#true} assume !(0 == ~cond); {13339#true} is VALID [2022-04-08 05:44:57,410 INFO L290 TraceCheckUtils]: 67: Hoare triple {13339#true} assume true; {13339#true} is VALID [2022-04-08 05:44:57,410 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13339#true} {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,410 INFO L272 TraceCheckUtils]: 69: Hoare triple {13509#(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_~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)); {13339#true} is VALID [2022-04-08 05:44:57,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {13339#true} ~cond := #in~cond; {13561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:57,411 INFO L290 TraceCheckUtils]: 71: Hoare triple {13561#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:44:57,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:44:57,412 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13565#(not (= |__VERIFIER_assert_#in~cond| 0))} {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {13509#(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_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:44:57,413 INFO L272 TraceCheckUtils]: 74: Hoare triple {13509#(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_~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)); {13575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:44:57,413 INFO L290 TraceCheckUtils]: 75: Hoare triple {13575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:44:57,413 INFO L290 TraceCheckUtils]: 76: Hoare triple {13579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13340#false} is VALID [2022-04-08 05:44:57,413 INFO L290 TraceCheckUtils]: 77: Hoare triple {13340#false} assume !false; {13340#false} is VALID [2022-04-08 05:44:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 05:44:57,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:45:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:45:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864470681] [2022-04-08 05:45:42,929 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:45:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043782248] [2022-04-08 05:45:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043782248] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:45:42,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:45:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 05:45:42,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:45:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484785318] [2022-04-08 05:45:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484785318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:45:42,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:45:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:45:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2324444] [2022-04-08 05:45:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:45:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-08 05:45:42,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:45:42,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:42,979 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-08 05:45:42,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:45:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:45:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-08 05:45:42,980 INFO L87 Difference]: Start difference. First operand 194 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:48,555 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2022-04-08 05:45:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:45:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 78 [2022-04-08 05:45:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:45:48,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 05:45:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2022-04-08 05:45:48,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 97 transitions. [2022-04-08 05:45:48,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:48,701 INFO L225 Difference]: With dead ends: 203 [2022-04-08 05:45:48,701 INFO L226 Difference]: Without dead ends: 201 [2022-04-08 05:45:48,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-04-08 05:45:48,702 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 55 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:45:48,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 240 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 05:45:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-08 05:45:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-04-08 05:45:48,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:45:48,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:45:48,984 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:45:48,984 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:45:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:48,989 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-08 05:45:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-08 05:45:48,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:48,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:48,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-08 05:45:48,990 INFO L87 Difference]: Start difference. First operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) Second operand 201 states. [2022-04-08 05:45:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:48,995 INFO L93 Difference]: Finished difference Result 201 states and 263 transitions. [2022-04-08 05:45:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2022-04-08 05:45:48,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:48,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:48,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:45:48,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:45:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.2357723577235773) internal successors, (152), 127 states have internal predecessors, (152), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (53), 50 states have call predecessors, (53), 53 states have call successors, (53) [2022-04-08 05:45:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2022-04-08 05:45:49,001 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 78 [2022-04-08 05:45:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:45:49,001 INFO L478 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2022-04-08 05:45:49,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 5 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 05:45:49,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 198 states and 260 transitions. [2022-04-08 05:45:49,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2022-04-08 05:45:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-08 05:45:49,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:45:49,302 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:45:49,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-08 05:45:49,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 05:45:49,503 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:45:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:45:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 3 times [2022-04-08 05:45:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:49,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540222113] [2022-04-08 05:45:49,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:45:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1849570232, now seen corresponding path program 4 times [2022-04-08 05:45:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:45:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241225536] [2022-04-08 05:45:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:45:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:45:49,512 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:45:49,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039576512] [2022-04-08 05:45:49,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:45:49,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:45:49,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:45:49,513 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-08 05:45:49,514 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-08 05:45:49,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:45:49,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:45:49,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 05:45:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:45:49,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:45:50,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {14816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {14816#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {14816#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-08 05:45:50,646 INFO L272 TraceCheckUtils]: 11: Hoare triple {14816#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {14816#true} ~cond := #in~cond; {14857#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:45:50,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {14857#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {14861#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:45:50,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {14861#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {14861#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:45:50,647 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14861#(not (= |assume_abort_if_not_#in~cond| 0))} {14816#true} #80#return; {14868#(<= 1 main_~y~0)} is VALID [2022-04-08 05:45:50,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {14868#(<= 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; {14872#(<= 1 main_~b~0)} is VALID [2022-04-08 05:45:50,648 INFO L272 TraceCheckUtils]: 17: Hoare triple {14872#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,648 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14872#(<= 1 main_~b~0)} #82#return; {14872#(<= 1 main_~b~0)} is VALID [2022-04-08 05:45:50,648 INFO L272 TraceCheckUtils]: 22: Hoare triple {14872#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,649 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14872#(<= 1 main_~b~0)} #84#return; {14872#(<= 1 main_~b~0)} is VALID [2022-04-08 05:45:50,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {14872#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14872#(<= 1 main_~b~0)} is VALID [2022-04-08 05:45:50,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {14872#(<= 1 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {14872#(<= 1 main_~b~0)} is VALID [2022-04-08 05:45:50,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {14872#(<= 1 main_~b~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,651 INFO L272 TraceCheckUtils]: 32: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,651 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,651 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,651 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #86#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,651 INFO L272 TraceCheckUtils]: 37: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,652 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #88#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,652 INFO L272 TraceCheckUtils]: 42: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,652 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,653 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #90#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,653 INFO L272 TraceCheckUtils]: 47: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 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)); {14816#true} is VALID [2022-04-08 05:45:50,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,654 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14816#true} {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} #92#return; {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {14912#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,655 INFO L272 TraceCheckUtils]: 55: Hoare triple {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,656 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {14995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:50,656 INFO L290 TraceCheckUtils]: 57: Hoare triple {14995#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:50,656 INFO L290 TraceCheckUtils]: 58: Hoare triple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:50,657 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} {14982#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (<= 1 main_~k~0) (<= 1 main_~b~0))} #86#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,657 INFO L272 TraceCheckUtils]: 60: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,657 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,657 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,657 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,658 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14816#true} {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #88#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,658 INFO L272 TraceCheckUtils]: 65: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:50,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,659 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14816#true} {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #90#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,659 INFO L272 TraceCheckUtils]: 70: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~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)); {14816#true} is VALID [2022-04-08 05:45:50,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:50,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:50,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:50,660 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14816#true} {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} #92#return; {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {15006#(and (<= main_~a~0 (+ main_~c~0 main_~b~0)) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (<= 1 main_~k~0) (<= 1 main_~b~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} assume !!(#t~post7 < 10);havoc #t~post7; {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} is VALID [2022-04-08 05:45:50,663 INFO L272 TraceCheckUtils]: 78: Hoare triple {15055#(and (= main_~c~0 (+ main_~a~0 (* (- 1) main_~b~0 main_~k~0))) (<= 2 main_~k~0) (<= (* main_~b~0 main_~k~0) (* main_~b~0 2)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:45:50,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:50,663 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-08 05:45:50,663 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-08 05:45:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 30 proven. 29 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-04-08 05:45:50,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:45:54,295 INFO L290 TraceCheckUtils]: 81: Hoare triple {14817#false} assume !false; {14817#false} is VALID [2022-04-08 05:45:54,296 INFO L290 TraceCheckUtils]: 80: Hoare triple {15069#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {14817#false} is VALID [2022-04-08 05:45:54,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15069#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:45:54,297 INFO L272 TraceCheckUtils]: 78: Hoare triple {15085#(= 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)); {15065#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:45:54,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,298 INFO L290 TraceCheckUtils]: 76: Hoare triple {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,299 INFO L290 TraceCheckUtils]: 75: Hoare triple {15085#(= 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; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,300 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {14816#true} {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,300 INFO L290 TraceCheckUtils]: 73: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,300 INFO L290 TraceCheckUtils]: 72: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,300 INFO L290 TraceCheckUtils]: 71: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,300 INFO L272 TraceCheckUtils]: 70: Hoare triple {15085#(= 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)); {14816#true} is VALID [2022-04-08 05:45:54,301 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {14816#true} {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,301 INFO L272 TraceCheckUtils]: 65: Hoare triple {15085#(= 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)); {14816#true} is VALID [2022-04-08 05:45:54,302 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {14816#true} {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,302 INFO L290 TraceCheckUtils]: 63: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,302 INFO L290 TraceCheckUtils]: 62: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,302 INFO L290 TraceCheckUtils]: 61: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,302 INFO L272 TraceCheckUtils]: 60: Hoare triple {15085#(= 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)); {14816#true} is VALID [2022-04-08 05:45:54,302 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} {14816#true} #86#return; {15085#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:45:54,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:54,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {15152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {14999#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:45:54,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {14816#true} ~cond := #in~cond; {15152#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:45:54,304 INFO L272 TraceCheckUtils]: 55: Hoare triple {14816#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 54: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {14816#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {14816#true} {14816#true} #92#return; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L272 TraceCheckUtils]: 47: Hoare triple {14816#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)); {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {14816#true} {14816#true} #90#return; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 45: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 44: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L290 TraceCheckUtils]: 43: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L272 TraceCheckUtils]: 42: Hoare triple {14816#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,304 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14816#true} {14816#true} #88#return; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L272 TraceCheckUtils]: 37: Hoare triple {14816#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14816#true} {14816#true} #86#return; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L272 TraceCheckUtils]: 32: Hoare triple {14816#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {14816#true} assume !!(#t~post7 < 10);havoc #t~post7; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {14816#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {14816#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 28: Hoare triple {14816#true} assume !!(#t~post6 < 10);havoc #t~post6; {14816#true} is VALID [2022-04-08 05:45:54,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {14816#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {14816#true} {14816#true} #84#return; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L272 TraceCheckUtils]: 22: Hoare triple {14816#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {14816#true} {14816#true} #82#return; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L272 TraceCheckUtils]: 17: Hoare triple {14816#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {14816#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; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14816#true} {14816#true} #80#return; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L272 TraceCheckUtils]: 11: Hoare triple {14816#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14816#true} {14816#true} #78#return; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {14816#true} assume !(0 == ~cond); {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {14816#true} ~cond := #in~cond; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {14816#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {14816#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {14816#true} call #t~ret8 := main(); {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14816#true} {14816#true} #98#return; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {14816#true} assume true; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {14816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {14816#true} is VALID [2022-04-08 05:45:54,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {14816#true} call ULTIMATE.init(); {14816#true} is VALID [2022-04-08 05:45:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-04-08 05:45:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:45:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241225536] [2022-04-08 05:45:54,308 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:45:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039576512] [2022-04-08 05:45:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039576512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:45:54,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:45:54,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 16 [2022-04-08 05:45:54,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:45:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540222113] [2022-04-08 05:45:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540222113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:45:54,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:45:54,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 05:45:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403439262] [2022-04-08 05:45:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:45:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-08 05:45:54,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:45:54,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:45:54,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:54,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 05:45:54,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 05:45:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-04-08 05:45:54,354 INFO L87 Difference]: Start difference. First operand 198 states and 260 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:45:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:58,469 INFO L93 Difference]: Finished difference Result 212 states and 278 transitions. [2022-04-08 05:45:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:45:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 82 [2022-04-08 05:45:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:45:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:45:58,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-08 05:45:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:45:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 106 transitions. [2022-04-08 05:45:58,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 106 transitions. [2022-04-08 05:45:58,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:58,571 INFO L225 Difference]: With dead ends: 212 [2022-04-08 05:45:58,571 INFO L226 Difference]: Without dead ends: 210 [2022-04-08 05:45:58,571 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:45:58,572 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 53 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:45:58,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 05:45:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-08 05:45:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2022-04-08 05:45:58,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:45:58,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:45:58,882 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:45:58,882 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:45:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:58,887 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-08 05:45:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-08 05:45:58,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:58,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:58,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-08 05:45:58,888 INFO L87 Difference]: Start difference. First operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 210 states. [2022-04-08 05:45:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:45:58,893 INFO L93 Difference]: Finished difference Result 210 states and 276 transitions. [2022-04-08 05:45:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 276 transitions. [2022-04-08 05:45:58,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:45:58,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:45:58,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:45:58,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:45:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 131 states have internal predecessors, (155), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:45:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 265 transitions. [2022-04-08 05:45:58,899 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 265 transitions. Word has length 82 [2022-04-08 05:45:58,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:45:58,899 INFO L478 AbstractCegarLoop]: Abstraction has 203 states and 265 transitions. [2022-04-08 05:45:58,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 11 states have internal predecessors, (30), 6 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-08 05:45:58,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 203 states and 265 transitions. [2022-04-08 05:45:59,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:45:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 265 transitions. [2022-04-08 05:45:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-08 05:45:59,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:45:59,236 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 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] [2022-04-08 05:45:59,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 05:45:59,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 05:45:59,437 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:45:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:45:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 1 times [2022-04-08 05:45:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:45:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1108407557] [2022-04-08 05:45:59,438 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:45:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1768368813, now seen corresponding path program 2 times [2022-04-08 05:45:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:45:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231670163] [2022-04-08 05:45:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:45:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:45:59,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:45:59,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398612998] [2022-04-08 05:45:59,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:45:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:45:59,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:45:59,452 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-08 05:45:59,454 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-08 05:45:59,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:45:59,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:45:59,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 05:45:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:45:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:45:59,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {16587#true} call ULTIMATE.init(); {16587#true} is VALID [2022-04-08 05:45:59,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {16587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16595#(<= ~counter~0 0)} {16587#true} #98#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {16595#(<= ~counter~0 0)} call #t~ret8 := main(); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {16595#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #78#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #80#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {16595#(<= ~counter~0 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; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,804 INFO L272 TraceCheckUtils]: 17: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,806 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #82#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,806 INFO L272 TraceCheckUtils]: 22: Hoare triple {16595#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {16595#(<= ~counter~0 0)} ~cond := #in~cond; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {16595#(<= ~counter~0 0)} assume !(0 == ~cond); {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {16595#(<= ~counter~0 0)} assume true; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,807 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16595#(<= ~counter~0 0)} {16595#(<= ~counter~0 0)} #84#return; {16595#(<= ~counter~0 0)} is VALID [2022-04-08 05:45:59,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {16595#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16674#(<= ~counter~0 1)} is VALID [2022-04-08 05:45:59,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {16674#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {16674#(<= ~counter~0 1)} is VALID [2022-04-08 05:45:59,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {16674#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {16674#(<= ~counter~0 1)} is VALID [2022-04-08 05:45:59,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {16674#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {16684#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,810 INFO L272 TraceCheckUtils]: 32: Hoare triple {16684#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,811 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #86#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,812 INFO L272 TraceCheckUtils]: 37: Hoare triple {16684#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,812 INFO L290 TraceCheckUtils]: 38: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,813 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #88#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,813 INFO L272 TraceCheckUtils]: 42: Hoare triple {16684#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,815 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #90#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,815 INFO L272 TraceCheckUtils]: 47: Hoare triple {16684#(<= ~counter~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)); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {16684#(<= ~counter~0 2)} ~cond := #in~cond; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {16684#(<= ~counter~0 2)} assume !(0 == ~cond); {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {16684#(<= ~counter~0 2)} assume true; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,817 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16684#(<= ~counter~0 2)} {16684#(<= ~counter~0 2)} #92#return; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {16684#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16684#(<= ~counter~0 2)} is VALID [2022-04-08 05:45:59,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {16684#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {16754#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,818 INFO L272 TraceCheckUtils]: 55: Hoare triple {16754#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,820 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #86#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,820 INFO L272 TraceCheckUtils]: 60: Hoare triple {16754#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,822 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #88#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,822 INFO L272 TraceCheckUtils]: 65: Hoare triple {16754#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,823 INFO L290 TraceCheckUtils]: 68: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,824 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #90#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,824 INFO L272 TraceCheckUtils]: 70: Hoare triple {16754#(<= ~counter~0 3)} 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)); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,824 INFO L290 TraceCheckUtils]: 71: Hoare triple {16754#(<= ~counter~0 3)} ~cond := #in~cond; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {16754#(<= ~counter~0 3)} assume !(0 == ~cond); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {16754#(<= ~counter~0 3)} assume true; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,826 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16754#(<= ~counter~0 3)} {16754#(<= ~counter~0 3)} #92#return; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {16754#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {16754#(<= ~counter~0 3)} ~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; {16754#(<= ~counter~0 3)} is VALID [2022-04-08 05:45:59,826 INFO L290 TraceCheckUtils]: 77: Hoare triple {16754#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16827#(<= |main_#t~post6| 3)} is VALID [2022-04-08 05:45:59,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {16827#(<= |main_#t~post6| 3)} assume !(#t~post6 < 10);havoc #t~post6; {16588#false} is VALID [2022-04-08 05:45:59,827 INFO L272 TraceCheckUtils]: 79: Hoare triple {16588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16588#false} is VALID [2022-04-08 05:45:59,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {16588#false} ~cond := #in~cond; {16588#false} is VALID [2022-04-08 05:45:59,827 INFO L290 TraceCheckUtils]: 81: Hoare triple {16588#false} assume 0 == ~cond; {16588#false} is VALID [2022-04-08 05:45:59,827 INFO L290 TraceCheckUtils]: 82: Hoare triple {16588#false} assume !false; {16588#false} is VALID [2022-04-08 05:45:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 73 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 05:45:59,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:00,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {16588#false} assume !false; {16588#false} is VALID [2022-04-08 05:46:00,160 INFO L290 TraceCheckUtils]: 81: Hoare triple {16588#false} assume 0 == ~cond; {16588#false} is VALID [2022-04-08 05:46:00,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {16588#false} ~cond := #in~cond; {16588#false} is VALID [2022-04-08 05:46:00,160 INFO L272 TraceCheckUtils]: 79: Hoare triple {16588#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {16588#false} is VALID [2022-04-08 05:46:00,160 INFO L290 TraceCheckUtils]: 78: Hoare triple {16855#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {16588#false} is VALID [2022-04-08 05:46:00,161 INFO L290 TraceCheckUtils]: 77: Hoare triple {16859#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16855#(< |main_#t~post6| 10)} is VALID [2022-04-08 05:46:00,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {16859#(< ~counter~0 10)} ~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; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {16859#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,162 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #92#return; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,162 INFO L290 TraceCheckUtils]: 73: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,162 INFO L290 TraceCheckUtils]: 72: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,162 INFO L290 TraceCheckUtils]: 71: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,162 INFO L272 TraceCheckUtils]: 70: Hoare triple {16859#(< ~counter~0 10)} 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)); {16587#true} is VALID [2022-04-08 05:46:00,163 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #90#return; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,163 INFO L272 TraceCheckUtils]: 65: Hoare triple {16859#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,164 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #88#return; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,164 INFO L272 TraceCheckUtils]: 60: Hoare triple {16859#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,165 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16587#true} {16859#(< ~counter~0 10)} #86#return; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,165 INFO L272 TraceCheckUtils]: 55: Hoare triple {16859#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {16859#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {16932#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16859#(< ~counter~0 10)} is VALID [2022-04-08 05:46:00,167 INFO L290 TraceCheckUtils]: 52: Hoare triple {16932#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,167 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #92#return; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,168 INFO L272 TraceCheckUtils]: 47: Hoare triple {16932#(< ~counter~0 9)} 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)); {16587#true} is VALID [2022-04-08 05:46:00,168 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #90#return; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,169 INFO L272 TraceCheckUtils]: 42: Hoare triple {16932#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,169 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #88#return; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,169 INFO L290 TraceCheckUtils]: 39: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,169 INFO L272 TraceCheckUtils]: 37: Hoare triple {16932#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,170 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16587#true} {16932#(< ~counter~0 9)} #86#return; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,170 INFO L272 TraceCheckUtils]: 32: Hoare triple {16932#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {16932#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {17002#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16932#(< ~counter~0 9)} is VALID [2022-04-08 05:46:00,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {17002#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {17002#(< ~counter~0 8)} is VALID [2022-04-08 05:46:00,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {17002#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {17002#(< ~counter~0 8)} is VALID [2022-04-08 05:46:00,172 INFO L290 TraceCheckUtils]: 27: Hoare triple {17012#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17002#(< ~counter~0 8)} is VALID [2022-04-08 05:46:00,173 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #84#return; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,173 INFO L272 TraceCheckUtils]: 22: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,173 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #82#return; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,174 INFO L272 TraceCheckUtils]: 17: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {17012#(< ~counter~0 7)} ~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; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,174 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #80#return; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,175 INFO L272 TraceCheckUtils]: 11: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16587#true} {17012#(< ~counter~0 7)} #78#return; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {16587#true} assume true; {16587#true} is VALID [2022-04-08 05:46:00,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {16587#true} assume !(0 == ~cond); {16587#true} is VALID [2022-04-08 05:46:00,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {16587#true} ~cond := #in~cond; {16587#true} is VALID [2022-04-08 05:46:00,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {17012#(< ~counter~0 7)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {16587#true} is VALID [2022-04-08 05:46:00,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {17012#(< ~counter~0 7)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {17012#(< ~counter~0 7)} call #t~ret8 := main(); {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17012#(< ~counter~0 7)} {16587#true} #98#return; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {17012#(< ~counter~0 7)} assume true; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {16587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {17012#(< ~counter~0 7)} is VALID [2022-04-08 05:46:00,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {16587#true} call ULTIMATE.init(); {16587#true} is VALID [2022-04-08 05:46:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:46:00,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231670163] [2022-04-08 05:46:00,177 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:00,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398612998] [2022-04-08 05:46:00,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398612998] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:00,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:00,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 05:46:00,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:00,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1108407557] [2022-04-08 05:46:00,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1108407557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:00,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:00,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:46:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022845545] [2022-04-08 05:46:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-08 05:46:00,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:00,179 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), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:00,221 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-08 05:46:00,221 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:46:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:46:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:46:00,222 INFO L87 Difference]: Start difference. First operand 203 states and 265 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:00,726 INFO L93 Difference]: Finished difference Result 214 states and 277 transitions. [2022-04-08 05:46:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:46:00,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 83 [2022-04-08 05:46:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 05:46:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-08 05:46:00,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-08 05:46:00,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:00,799 INFO L225 Difference]: With dead ends: 214 [2022-04-08 05:46:00,799 INFO L226 Difference]: Without dead ends: 206 [2022-04-08 05:46:00,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:46:00,800 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:00,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 160 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 05:46:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-08 05:46:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-08 05:46:01,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:01,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:46:01,152 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:46:01,153 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:46:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:01,157 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-08 05:46:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-08 05:46:01,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:01,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:01,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-08 05:46:01,158 INFO L87 Difference]: Start difference. First operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 206 states. [2022-04-08 05:46:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:01,163 INFO L93 Difference]: Finished difference Result 206 states and 268 transitions. [2022-04-08 05:46:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-08 05:46:01,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:01,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:01,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:01,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 129 states have (on average 1.2248062015503876) internal successors, (158), 134 states have internal predecessors, (158), 56 states have call successors, (56), 21 states have call predecessors, (56), 20 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-08 05:46:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 268 transitions. [2022-04-08 05:46:01,169 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 268 transitions. Word has length 83 [2022-04-08 05:46:01,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:01,169 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 268 transitions. [2022-04-08 05:46:01,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:01,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 268 transitions. [2022-04-08 05:46:01,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 268 transitions. [2022-04-08 05:46:01,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-08 05:46:01,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:01,532 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 2, 2, 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] [2022-04-08 05:46:01,557 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-08 05:46:01,733 WARN L460 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-08 05:46:01,733 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 1 times [2022-04-08 05:46:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:01,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [430406498] [2022-04-08 05:46:01,734 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1017110725, now seen corresponding path program 2 times [2022-04-08 05:46:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:01,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835997530] [2022-04-08 05:46:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:01,745 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:01,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475680548] [2022-04-08 05:46:01,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:01,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:01,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:01,749 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-08 05:46:01,750 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-08 05:46:01,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:46:01,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:01,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 05:46:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:01,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:02,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #98#return; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret8 := main(); {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L272 TraceCheckUtils]: 6: Hoare triple {18352#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18352#true} {18352#true} #78#return; {18352#true} is VALID [2022-04-08 05:46:02,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {18352#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18352#true} {18352#true} #80#return; {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {18352#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; {18405#(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-08 05:46:02,187 INFO L272 TraceCheckUtils]: 17: Hoare triple {18405#(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)); {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,188 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18352#true} {18405#(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))} #82#return; {18405#(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-08 05:46:02,188 INFO L272 TraceCheckUtils]: 22: Hoare triple {18405#(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)); {18352#true} is VALID [2022-04-08 05:46:02,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,188 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18352#true} {18405#(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))} #84#return; {18405#(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-08 05:46:02,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {18405#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18405#(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-08 05:46:02,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {18405#(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 !!(#t~post6 < 10);havoc #t~post6; {18405#(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-08 05:46:02,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {18405#(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; {18445#(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-08 05:46:02,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {18445#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18445#(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-08 05:46:02,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {18445#(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 !!(#t~post7 < 10);havoc #t~post7; {18445#(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-08 05:46:02,190 INFO L272 TraceCheckUtils]: 32: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-08 05:46:02,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,191 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18352#true} {18445#(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))} #86#return; {18445#(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-08 05:46:02,191 INFO L272 TraceCheckUtils]: 37: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-08 05:46:02,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,191 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18352#true} {18445#(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))} #88#return; {18445#(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-08 05:46:02,191 INFO L272 TraceCheckUtils]: 42: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-08 05:46:02,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,212 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18352#true} {18445#(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))} #90#return; {18445#(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-08 05:46:02,212 INFO L272 TraceCheckUtils]: 47: Hoare triple {18445#(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)); {18352#true} is VALID [2022-04-08 05:46:02,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,213 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18352#true} {18445#(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))} #92#return; {18445#(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-08 05:46:02,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {18445#(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; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,214 INFO L290 TraceCheckUtils]: 53: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,214 INFO L272 TraceCheckUtils]: 55: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:02,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,215 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,215 INFO L272 TraceCheckUtils]: 60: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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)); {18352#true} is VALID [2022-04-08 05:46:02,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,215 INFO L290 TraceCheckUtils]: 63: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,215 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #88#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,216 INFO L272 TraceCheckUtils]: 65: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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)); {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L290 TraceCheckUtils]: 66: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #90#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,216 INFO L272 TraceCheckUtils]: 70: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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)); {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L290 TraceCheckUtils]: 71: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L290 TraceCheckUtils]: 72: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:02,216 INFO L290 TraceCheckUtils]: 73: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:02,217 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18352#true} {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:46:02,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {18515#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= 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; {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:46:02,218 INFO L290 TraceCheckUtils]: 77: Hoare triple {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:46:02,218 INFO L290 TraceCheckUtils]: 78: Hoare triple {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:46:02,218 INFO L290 TraceCheckUtils]: 79: Hoare triple {18588#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(0 != ~b~0); {18598#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-08 05:46:02,219 INFO L272 TraceCheckUtils]: 80: Hoare triple {18598#(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)); {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:02,219 INFO L290 TraceCheckUtils]: 81: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:02,219 INFO L290 TraceCheckUtils]: 82: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18353#false} is VALID [2022-04-08 05:46:02,219 INFO L290 TraceCheckUtils]: 83: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-08 05:46:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:46:02,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:02,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-08 05:46:02,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18353#false} is VALID [2022-04-08 05:46:02,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:02,683 INFO L272 TraceCheckUtils]: 80: Hoare triple {18622#(= (+ (* 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)); {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:02,683 INFO L290 TraceCheckUtils]: 79: Hoare triple {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {18622#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-08 05:46:02,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:46:02,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:46:04,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {18636#(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; {18626#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:46:04,353 INFO L290 TraceCheckUtils]: 75: Hoare triple {18636#(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))} assume !(~c~0 >= ~b~0); {18636#(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-08 05:46:04,354 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {18352#true} {18636#(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))} #92#return; {18636#(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-08 05:46:04,354 INFO L290 TraceCheckUtils]: 73: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,354 INFO L272 TraceCheckUtils]: 70: Hoare triple {18636#(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))} 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)); {18352#true} is VALID [2022-04-08 05:46:04,354 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {18352#true} {18636#(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))} #90#return; {18636#(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-08 05:46:04,355 INFO L290 TraceCheckUtils]: 68: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,355 INFO L290 TraceCheckUtils]: 67: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,355 INFO L290 TraceCheckUtils]: 66: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,355 INFO L272 TraceCheckUtils]: 65: Hoare triple {18636#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,355 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18352#true} {18636#(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))} #88#return; {18636#(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-08 05:46:04,355 INFO L290 TraceCheckUtils]: 63: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,356 INFO L272 TraceCheckUtils]: 60: Hoare triple {18636#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,356 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18352#true} {18636#(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))} #86#return; {18636#(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-08 05:46:04,356 INFO L290 TraceCheckUtils]: 58: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,357 INFO L272 TraceCheckUtils]: 55: Hoare triple {18636#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {18636#(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))} assume !!(#t~post7 < 10);havoc #t~post7; {18636#(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-08 05:46:04,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {18636#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18636#(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-08 05:46:04,606 INFO L290 TraceCheckUtils]: 52: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {18636#(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-08 05:46:04,607 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #92#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,608 INFO L272 TraceCheckUtils]: 47: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 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)); {18352#true} is VALID [2022-04-08 05:46:04,608 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #90#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,609 INFO L290 TraceCheckUtils]: 44: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,609 INFO L272 TraceCheckUtils]: 42: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,609 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #88#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,610 INFO L272 TraceCheckUtils]: 37: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,610 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18352#true} {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #86#return; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,611 INFO L272 TraceCheckUtils]: 32: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} assume !!(#t~post7 < 10);havoc #t~post7; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {18709#(or (not (= (+ main_~c~0 (* (- 1) main_~b~0)) 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))))) 0))} is VALID [2022-04-08 05:46:04,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} assume !!(#t~post6 < 10);havoc #t~post6; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:46:04,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:46:04,614 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18352#true} {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #84#return; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:46:04,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,614 INFO L272 TraceCheckUtils]: 22: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,614 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {18352#true} {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} #82#return; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:46:04,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,615 INFO L272 TraceCheckUtils]: 17: Hoare triple {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {18352#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; {18779#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))) 0) (not (= (+ main_~a~0 (* (- 1) main_~b~0)) 0)))} is VALID [2022-04-08 05:46:04,615 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18352#true} {18352#true} #80#return; {18352#true} is VALID [2022-04-08 05:46:04,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L272 TraceCheckUtils]: 11: Hoare triple {18352#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18352#true} {18352#true} #78#return; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {18352#true} assume !(0 == ~cond); {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {18352#true} ~cond := #in~cond; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L272 TraceCheckUtils]: 6: Hoare triple {18352#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret8 := main(); {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #98#return; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {18352#true} is VALID [2022-04-08 05:46:04,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-08 05:46:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:46:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835997530] [2022-04-08 05:46:04,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:04,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475680548] [2022-04-08 05:46:04,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475680548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:04,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:04,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 05:46:04,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:04,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [430406498] [2022-04-08 05:46:04,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [430406498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:04,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:04,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:46:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270766348] [2022-04-08 05:46:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-08 05:46:04,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:04,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:04,662 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-08 05:46:04,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:46:04,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:04,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:46:04,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:46:04,663 INFO L87 Difference]: Start difference. First operand 206 states and 268 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:05,926 INFO L93 Difference]: Finished difference Result 234 states and 311 transitions. [2022-04-08 05:46:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 05:46:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-04-08 05:46:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 05:46:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2022-04-08 05:46:05,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 114 transitions. [2022-04-08 05:46:06,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:06,039 INFO L225 Difference]: With dead ends: 234 [2022-04-08 05:46:06,039 INFO L226 Difference]: Without dead ends: 232 [2022-04-08 05:46:06,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-04-08 05:46:06,039 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:06,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 307 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 05:46:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-04-08 05:46:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2022-04-08 05:46:06,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:06,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:46:06,412 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:46:06,412 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:46:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:06,417 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-08 05:46:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-08 05:46:06,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:06,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:06,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-08 05:46:06,418 INFO L87 Difference]: Start difference. First operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) Second operand 232 states. [2022-04-08 05:46:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:06,423 INFO L93 Difference]: Finished difference Result 232 states and 309 transitions. [2022-04-08 05:46:06,423 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 309 transitions. [2022-04-08 05:46:06,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:06,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:06,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:06,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 141 states have (on average 1.24822695035461) internal successors, (176), 148 states have internal predecessors, (176), 66 states have call successors, (66), 22 states have call predecessors, (66), 21 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2022-04-08 05:46:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 306 transitions. [2022-04-08 05:46:06,430 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 306 transitions. Word has length 84 [2022-04-08 05:46:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:06,430 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 306 transitions. [2022-04-08 05:46:06,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:06,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 306 transitions. [2022-04-08 05:46:06,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 306 transitions. [2022-04-08 05:46:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 05:46:06,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:06,798 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 2, 2, 2, 2, 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] [2022-04-08 05:46:06,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-08 05:46:06,998 WARN L460 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-08 05:46:06,999 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:06,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 3 times [2022-04-08 05:46:06,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:06,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855775286] [2022-04-08 05:46:07,000 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1676300815, now seen corresponding path program 4 times [2022-04-08 05:46:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:07,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309093640] [2022-04-08 05:46:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:07,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:07,010 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:07,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306113485] [2022-04-08 05:46:07,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:46:07,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:07,014 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-08 05:46:07,019 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-08 05:46:07,064 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:46:07,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:07,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 05:46:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:07,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:07,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {20267#true} call ULTIMATE.init(); {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {20267#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20267#true} {20267#true} #98#return; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {20267#true} call #t~ret8 := main(); {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {20267#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L272 TraceCheckUtils]: 6: Hoare triple {20267#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20267#true} {20267#true} #78#return; {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L272 TraceCheckUtils]: 11: Hoare triple {20267#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20267#true} {20267#true} #80#return; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {20267#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; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L272 TraceCheckUtils]: 17: Hoare triple {20267#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {20267#true} {20267#true} #82#return; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L272 TraceCheckUtils]: 22: Hoare triple {20267#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20267#true} {20267#true} #84#return; {20267#true} is VALID [2022-04-08 05:46:07,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {20267#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {20267#true} assume !!(#t~post6 < 10);havoc #t~post6; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {20267#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {20267#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {20267#true} assume !!(#t~post7 < 10);havoc #t~post7; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L272 TraceCheckUtils]: 32: Hoare triple {20267#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20267#true} {20267#true} #86#return; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L272 TraceCheckUtils]: 37: Hoare triple {20267#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20267#true} {20267#true} #88#return; {20267#true} is VALID [2022-04-08 05:46:07,261 INFO L272 TraceCheckUtils]: 42: Hoare triple {20267#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20267#true} {20267#true} #90#return; {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L272 TraceCheckUtils]: 47: Hoare triple {20267#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)); {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 50: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {20267#true} {20267#true} #92#return; {20267#true} is VALID [2022-04-08 05:46:07,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {20267#true} assume !(~c~0 >= ~b~0); {20428#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:46:07,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {20428#(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; {20432#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:46:07,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {20432#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20432#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:46:07,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {20432#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {20432#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:46:07,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {20432#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,264 INFO L290 TraceCheckUtils]: 57: Hoare triple {20442#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {20442#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,264 INFO L272 TraceCheckUtils]: 59: Hoare triple {20442#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,265 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #86#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,265 INFO L272 TraceCheckUtils]: 64: Hoare triple {20442#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,265 INFO L290 TraceCheckUtils]: 66: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,265 INFO L290 TraceCheckUtils]: 67: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #88#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,266 INFO L272 TraceCheckUtils]: 69: Hoare triple {20442#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L290 TraceCheckUtils]: 70: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #90#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,266 INFO L272 TraceCheckUtils]: 74: Hoare triple {20442#(< 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)); {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {20267#true} ~cond := #in~cond; {20267#true} is VALID [2022-04-08 05:46:07,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {20267#true} assume !(0 == ~cond); {20267#true} is VALID [2022-04-08 05:46:07,267 INFO L290 TraceCheckUtils]: 77: Hoare triple {20267#true} assume true; {20267#true} is VALID [2022-04-08 05:46:07,267 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {20267#true} {20442#(< main_~b~0 main_~c~0)} #92#return; {20442#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 79: Hoare triple {20442#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {20268#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; {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 81: Hoare triple {20268#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 82: Hoare triple {20268#false} assume !(#t~post6 < 10);havoc #t~post6; {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L272 TraceCheckUtils]: 83: Hoare triple {20268#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {20268#false} ~cond := #in~cond; {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {20268#false} assume 0 == ~cond; {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {20268#false} assume !false; {20268#false} is VALID [2022-04-08 05:46:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:46:07,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 05:46:07,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309093640] [2022-04-08 05:46:07,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306113485] [2022-04-08 05:46:07,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306113485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:07,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:07,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:46:07,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:07,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855775286] [2022-04-08 05:46:07,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855775286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:07,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:07,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 05:46:07,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400349881] [2022-04-08 05:46:07,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:07,271 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-08 05:46:07,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:07,272 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:46:07,308 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-08 05:46:07,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 05:46:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:07,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 05:46:07,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 05:46:07,314 INFO L87 Difference]: Start difference. First operand 229 states and 306 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:46:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:07,981 INFO L93 Difference]: Finished difference Result 371 states and 532 transitions. [2022-04-08 05:46:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 05:46:07,981 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-08 05:46:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:07,982 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:46:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-08 05:46:07,983 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:46:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2022-04-08 05:46:07,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 110 transitions. [2022-04-08 05:46:08,088 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-08 05:46:08,094 INFO L225 Difference]: With dead ends: 371 [2022-04-08 05:46:08,094 INFO L226 Difference]: Without dead ends: 291 [2022-04-08 05:46:08,094 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 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-08 05:46:08,095 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:08,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:46:08,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-04-08 05:46:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 257. [2022-04-08 05:46:08,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:08,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 05:46:08,489 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 05:46:08,489 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 05:46:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:08,496 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-08 05:46:08,496 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-08 05:46:08,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:08,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:08,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-08 05:46:08,497 INFO L87 Difference]: Start difference. First operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 291 states. [2022-04-08 05:46:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:08,504 INFO L93 Difference]: Finished difference Result 291 states and 403 transitions. [2022-04-08 05:46:08,504 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 403 transitions. [2022-04-08 05:46:08,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:08,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:08,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:08,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 168 states have internal predecessors, (202), 74 states have call successors, (74), 22 states have call predecessors, (74), 21 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-08 05:46:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-08 05:46:08,511 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 87 [2022-04-08 05:46:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:08,511 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-08 05:46:08,511 INFO L479 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:46:08,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-08 05:46:08,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-08 05:46:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 05:46:08,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:08,904 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 2, 2, 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-08 05:46:08,937 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-08 05:46:09,138 WARN L460 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-08 05:46:09,138 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:09,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 1 times [2022-04-08 05:46:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:09,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573581879] [2022-04-08 05:46:09,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1175887352, now seen corresponding path program 2 times [2022-04-08 05:46:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:09,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571855133] [2022-04-08 05:46:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:09,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:09,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [276800562] [2022-04-08 05:46:09,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:09,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:09,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:09,150 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-08 05:46:09,151 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-08 05:46:09,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:46:09,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:09,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 05:46:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:09,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:09,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {22375#true} call ULTIMATE.init(); {22375#true} is VALID [2022-04-08 05:46:09,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {22375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {22375#true} is VALID [2022-04-08 05:46:09,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22375#true} {22375#true} #98#return; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {22375#true} call #t~ret8 := main(); {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {22375#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L272 TraceCheckUtils]: 6: Hoare triple {22375#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22375#true} {22375#true} #78#return; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L272 TraceCheckUtils]: 11: Hoare triple {22375#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22375#true} {22375#true} #80#return; {22375#true} is VALID [2022-04-08 05:46:09,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {22375#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; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,367 INFO L272 TraceCheckUtils]: 17: Hoare triple {22428#(= main_~q~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #82#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,367 INFO L272 TraceCheckUtils]: 22: Hoare triple {22428#(= main_~q~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,367 INFO L290 TraceCheckUtils]: 25: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,368 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #84#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {22428#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {22428#(= main_~q~0 0)} assume !!(#t~post6 < 10);havoc #t~post6; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {22428#(= main_~q~0 0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {22428#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {22428#(= main_~q~0 0)} assume !!(#t~post7 < 10);havoc #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,372 INFO L272 TraceCheckUtils]: 32: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #86#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,372 INFO L272 TraceCheckUtils]: 37: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,372 INFO L290 TraceCheckUtils]: 40: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,373 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #88#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,373 INFO L272 TraceCheckUtils]: 42: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,373 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #90#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,373 INFO L272 TraceCheckUtils]: 47: Hoare triple {22428#(= 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)); {22375#true} is VALID [2022-04-08 05:46:09,373 INFO L290 TraceCheckUtils]: 48: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,374 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #92#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {22428#(= main_~q~0 0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,374 INFO L290 TraceCheckUtils]: 53: Hoare triple {22428#(= main_~q~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,374 INFO L290 TraceCheckUtils]: 54: Hoare triple {22428#(= main_~q~0 0)} assume !!(#t~post7 < 10);havoc #t~post7; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,375 INFO L272 TraceCheckUtils]: 55: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L290 TraceCheckUtils]: 58: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #86#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,375 INFO L272 TraceCheckUtils]: 60: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,376 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22375#true} {22428#(= main_~q~0 0)} #88#return; {22428#(= main_~q~0 0)} is VALID [2022-04-08 05:46:09,376 INFO L272 TraceCheckUtils]: 65: Hoare triple {22428#(= main_~q~0 0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,376 INFO L290 TraceCheckUtils]: 66: Hoare triple {22375#true} ~cond := #in~cond; {22579#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:09,376 INFO L290 TraceCheckUtils]: 67: Hoare triple {22579#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:09,376 INFO L290 TraceCheckUtils]: 68: Hoare triple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:09,377 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} {22428#(= main_~q~0 0)} #90#return; {22590#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 05:46:09,377 INFO L272 TraceCheckUtils]: 70: Hoare triple {22590#(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)); {22375#true} is VALID [2022-04-08 05:46:09,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,377 INFO L290 TraceCheckUtils]: 72: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,377 INFO L290 TraceCheckUtils]: 73: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,377 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22375#true} {22590#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} #92#return; {22590#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 05:46:09,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {22590#(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); {22590#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~q~0 0))} is VALID [2022-04-08 05:46:09,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {22590#(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; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 05:46:09,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 05:46:09,379 INFO L290 TraceCheckUtils]: 78: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !!(#t~post6 < 10);havoc #t~post6; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 05:46:09,379 INFO L290 TraceCheckUtils]: 79: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} assume !(0 != ~b~0); {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 05:46:09,379 INFO L272 TraceCheckUtils]: 80: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:09,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:09,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:09,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:09,379 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22375#true} {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} #94#return; {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} is VALID [2022-04-08 05:46:09,380 INFO L272 TraceCheckUtils]: 85: Hoare triple {22612#(and (= main_~p~0 0) (= (* main_~y~0 main_~r~0) main_~a~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:09,380 INFO L290 TraceCheckUtils]: 86: Hoare triple {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:09,380 INFO L290 TraceCheckUtils]: 87: Hoare triple {22644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22376#false} is VALID [2022-04-08 05:46:09,380 INFO L290 TraceCheckUtils]: 88: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-04-08 05:46:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-08 05:46:09,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:27,009 INFO L290 TraceCheckUtils]: 88: Hoare triple {22376#false} assume !false; {22376#false} is VALID [2022-04-08 05:46:27,009 INFO L290 TraceCheckUtils]: 87: Hoare triple {22644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22376#false} is VALID [2022-04-08 05:46:27,010 INFO L290 TraceCheckUtils]: 86: Hoare triple {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:27,010 INFO L272 TraceCheckUtils]: 85: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 + ~r~0 * ~y~0 == ~a~0 then 1 else 0)); {22640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:27,011 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {22375#true} {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #94#return; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:46:27,011 INFO L290 TraceCheckUtils]: 83: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,011 INFO L272 TraceCheckUtils]: 80: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,011 INFO L290 TraceCheckUtils]: 79: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !(0 != ~b~0); {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:46:27,012 INFO L290 TraceCheckUtils]: 78: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:46:27,012 INFO L290 TraceCheckUtils]: 77: Hoare triple {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:46:27,013 INFO L290 TraceCheckUtils]: 76: Hoare triple {22688#(= 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; {22660#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:46:27,013 INFO L290 TraceCheckUtils]: 75: Hoare triple {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:27,014 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {22375#true} {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:27,014 INFO L290 TraceCheckUtils]: 73: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,014 INFO L290 TraceCheckUtils]: 72: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,014 INFO L290 TraceCheckUtils]: 71: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,014 INFO L272 TraceCheckUtils]: 70: Hoare triple {22688#(= 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)); {22375#true} is VALID [2022-04-08 05:46:27,014 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} {22375#true} #90#return; {22688#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:46:27,015 INFO L290 TraceCheckUtils]: 68: Hoare triple {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:27,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {22719#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:27,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {22375#true} ~cond := #in~cond; {22719#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:46:27,015 INFO L272 TraceCheckUtils]: 65: Hoare triple {22375#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {22375#true} {22375#true} #88#return; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 63: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L272 TraceCheckUtils]: 60: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {22375#true} {22375#true} #86#return; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L272 TraceCheckUtils]: 55: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {22375#true} assume !!(#t~post7 < 10);havoc #t~post7; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {22375#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {22375#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {22375#true} is VALID [2022-04-08 05:46:27,016 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {22375#true} {22375#true} #92#return; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 50: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L272 TraceCheckUtils]: 47: Hoare triple {22375#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)); {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {22375#true} {22375#true} #90#return; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 44: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 43: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L272 TraceCheckUtils]: 42: Hoare triple {22375#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {22375#true} {22375#true} #88#return; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 40: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L272 TraceCheckUtils]: 37: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,017 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22375#true} {22375#true} #86#return; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L272 TraceCheckUtils]: 32: Hoare triple {22375#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {22375#true} assume !!(#t~post7 < 10);havoc #t~post7; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {22375#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {22375#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {22375#true} assume !!(#t~post6 < 10);havoc #t~post6; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {22375#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22375#true} {22375#true} #84#return; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L272 TraceCheckUtils]: 22: Hoare triple {22375#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,018 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {22375#true} {22375#true} #82#return; {22375#true} is VALID [2022-04-08 05:46:27,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,021 INFO L272 TraceCheckUtils]: 17: Hoare triple {22375#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {22375#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; {22375#true} is VALID [2022-04-08 05:46:27,022 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22375#true} {22375#true} #80#return; {22375#true} is VALID [2022-04-08 05:46:27,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {22375#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22375#true} {22375#true} #78#return; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {22375#true} assume !(0 == ~cond); {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {22375#true} ~cond := #in~cond; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {22375#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {22375#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {22375#true} call #t~ret8 := main(); {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22375#true} {22375#true} #98#return; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {22375#true} assume true; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {22375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {22375#true} is VALID [2022-04-08 05:46:27,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {22375#true} call ULTIMATE.init(); {22375#true} is VALID [2022-04-08 05:46:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-04-08 05:46:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571855133] [2022-04-08 05:46:27,036 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276800562] [2022-04-08 05:46:27,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276800562] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:27,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:27,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-08 05:46:27,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573581879] [2022-04-08 05:46:27,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573581879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:27,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:27,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:46:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103840818] [2022-04-08 05:46:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-08 05:46:27,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:27,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:27,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:27,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:46:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:46:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:46:27,081 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:28,280 INFO L93 Difference]: Finished difference Result 301 states and 415 transitions. [2022-04-08 05:46:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:46:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 89 [2022-04-08 05:46:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-08 05:46:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2022-04-08 05:46:28,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 89 transitions. [2022-04-08 05:46:28,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:28,362 INFO L225 Difference]: With dead ends: 301 [2022-04-08 05:46:28,362 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 05:46:28,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:46:28,362 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:28,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 226 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 05:46:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 05:46:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 293. [2022-04-08 05:46:28,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:28,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:46:28,896 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:46:28,897 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:46:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:28,903 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-08 05:46:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-08 05:46:28,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:28,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:28,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-08 05:46:28,904 INFO L87 Difference]: Start difference. First operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) Second operand 297 states. [2022-04-08 05:46:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:28,910 INFO L93 Difference]: Finished difference Result 297 states and 408 transitions. [2022-04-08 05:46:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2022-04-08 05:46:28,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:28,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:28,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:28,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 183 states have (on average 1.273224043715847) internal successors, (233), 191 states have internal predecessors, (233), 87 states have call successors, (87), 23 states have call predecessors, (87), 22 states have return successors, (84), 78 states have call predecessors, (84), 84 states have call successors, (84) [2022-04-08 05:46:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 404 transitions. [2022-04-08 05:46:28,917 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 404 transitions. Word has length 89 [2022-04-08 05:46:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:28,918 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 404 transitions. [2022-04-08 05:46:28,918 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-08 05:46:28,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 404 transitions. [2022-04-08 05:46:29,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 404 transitions. [2022-04-08 05:46:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-08 05:46:29,470 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:29,470 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 2, 2, 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] [2022-04-08 05:46:29,503 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-08 05:46:29,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 05:46:29,671 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:29,671 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 1 times [2022-04-08 05:46:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:29,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203046259] [2022-04-08 05:46:29,672 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:29,672 INFO L85 PathProgramCache]: Analyzing trace with hash -201422586, now seen corresponding path program 2 times [2022-04-08 05:46:29,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:29,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910141318] [2022-04-08 05:46:29,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:29,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:29,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:29,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [900292201] [2022-04-08 05:46:29,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:29,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:29,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:29,683 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-08 05:46:29,684 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-08 05:46:29,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:46:29,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:29,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 05:46:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:29,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:30,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {24706#true} call ULTIMATE.init(); {24706#true} is VALID [2022-04-08 05:46:30,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {24706#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24714#(<= ~counter~0 0)} {24706#true} #98#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {24714#(<= ~counter~0 0)} call #t~ret8 := main(); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {24714#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,116 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #78#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,116 INFO L272 TraceCheckUtils]: 11: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,117 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #80#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {24714#(<= ~counter~0 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; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,119 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #82#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,120 INFO L272 TraceCheckUtils]: 22: Hoare triple {24714#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {24714#(<= ~counter~0 0)} ~cond := #in~cond; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {24714#(<= ~counter~0 0)} assume !(0 == ~cond); {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {24714#(<= ~counter~0 0)} assume true; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,121 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24714#(<= ~counter~0 0)} {24714#(<= ~counter~0 0)} #84#return; {24714#(<= ~counter~0 0)} is VALID [2022-04-08 05:46:30,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {24714#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24793#(<= ~counter~0 1)} is VALID [2022-04-08 05:46:30,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {24793#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {24793#(<= ~counter~0 1)} is VALID [2022-04-08 05:46:30,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {24793#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24793#(<= ~counter~0 1)} is VALID [2022-04-08 05:46:30,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {24793#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {24803#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,124 INFO L272 TraceCheckUtils]: 32: Hoare triple {24803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,125 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #86#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,125 INFO L272 TraceCheckUtils]: 37: Hoare triple {24803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,127 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #88#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,127 INFO L272 TraceCheckUtils]: 42: Hoare triple {24803#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,128 INFO L290 TraceCheckUtils]: 44: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,128 INFO L290 TraceCheckUtils]: 45: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,129 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #90#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,129 INFO L272 TraceCheckUtils]: 47: Hoare triple {24803#(<= ~counter~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)); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {24803#(<= ~counter~0 2)} ~cond := #in~cond; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,130 INFO L290 TraceCheckUtils]: 49: Hoare triple {24803#(<= ~counter~0 2)} assume !(0 == ~cond); {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,130 INFO L290 TraceCheckUtils]: 50: Hoare triple {24803#(<= ~counter~0 2)} assume true; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,131 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24803#(<= ~counter~0 2)} {24803#(<= ~counter~0 2)} #92#return; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,131 INFO L290 TraceCheckUtils]: 52: Hoare triple {24803#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {24803#(<= ~counter~0 2)} is VALID [2022-04-08 05:46:30,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {24803#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {24873#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,133 INFO L272 TraceCheckUtils]: 55: Hoare triple {24873#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,133 INFO L290 TraceCheckUtils]: 56: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,133 INFO L290 TraceCheckUtils]: 57: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,134 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #86#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,135 INFO L272 TraceCheckUtils]: 60: Hoare triple {24873#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,135 INFO L290 TraceCheckUtils]: 61: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,137 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #88#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,137 INFO L272 TraceCheckUtils]: 65: Hoare triple {24873#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,139 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #90#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,140 INFO L272 TraceCheckUtils]: 70: Hoare triple {24873#(<= ~counter~0 3)} 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)); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {24873#(<= ~counter~0 3)} ~cond := #in~cond; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {24873#(<= ~counter~0 3)} assume !(0 == ~cond); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {24873#(<= ~counter~0 3)} assume true; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,141 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24873#(<= ~counter~0 3)} {24873#(<= ~counter~0 3)} #92#return; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,141 INFO L290 TraceCheckUtils]: 75: Hoare triple {24873#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {24873#(<= ~counter~0 3)} ~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; {24873#(<= ~counter~0 3)} is VALID [2022-04-08 05:46:30,143 INFO L290 TraceCheckUtils]: 77: Hoare triple {24873#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24946#(<= ~counter~0 4)} is VALID [2022-04-08 05:46:30,143 INFO L290 TraceCheckUtils]: 78: Hoare triple {24946#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {24946#(<= ~counter~0 4)} is VALID [2022-04-08 05:46:30,143 INFO L290 TraceCheckUtils]: 79: Hoare triple {24946#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {24946#(<= ~counter~0 4)} is VALID [2022-04-08 05:46:30,144 INFO L290 TraceCheckUtils]: 80: Hoare triple {24946#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24956#(<= |main_#t~post7| 4)} is VALID [2022-04-08 05:46:30,144 INFO L290 TraceCheckUtils]: 81: Hoare triple {24956#(<= |main_#t~post7| 4)} assume !(#t~post7 < 10);havoc #t~post7; {24707#false} is VALID [2022-04-08 05:46:30,144 INFO L290 TraceCheckUtils]: 82: Hoare triple {24707#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; {24707#false} is VALID [2022-04-08 05:46:30,144 INFO L290 TraceCheckUtils]: 83: Hoare triple {24707#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24707#false} is VALID [2022-04-08 05:46:30,144 INFO L290 TraceCheckUtils]: 84: Hoare triple {24707#false} assume !(#t~post6 < 10);havoc #t~post6; {24707#false} is VALID [2022-04-08 05:46:30,144 INFO L272 TraceCheckUtils]: 85: Hoare triple {24707#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24707#false} is VALID [2022-04-08 05:46:30,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {24707#false} ~cond := #in~cond; {24707#false} is VALID [2022-04-08 05:46:30,145 INFO L290 TraceCheckUtils]: 87: Hoare triple {24707#false} assume 0 == ~cond; {24707#false} is VALID [2022-04-08 05:46:30,145 INFO L290 TraceCheckUtils]: 88: Hoare triple {24707#false} assume !false; {24707#false} is VALID [2022-04-08 05:46:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 05:46:30,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:46:30,437 INFO L290 TraceCheckUtils]: 88: Hoare triple {24707#false} assume !false; {24707#false} is VALID [2022-04-08 05:46:30,437 INFO L290 TraceCheckUtils]: 87: Hoare triple {24707#false} assume 0 == ~cond; {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {24707#false} ~cond := #in~cond; {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L272 TraceCheckUtils]: 85: Hoare triple {24707#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {24707#false} assume !(#t~post6 < 10);havoc #t~post6; {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {24707#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L290 TraceCheckUtils]: 82: Hoare triple {24707#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; {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L290 TraceCheckUtils]: 81: Hoare triple {25002#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {24707#false} is VALID [2022-04-08 05:46:30,438 INFO L290 TraceCheckUtils]: 80: Hoare triple {25006#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25002#(< |main_#t~post7| 10)} is VALID [2022-04-08 05:46:30,439 INFO L290 TraceCheckUtils]: 79: Hoare triple {25006#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25006#(< ~counter~0 10)} is VALID [2022-04-08 05:46:30,439 INFO L290 TraceCheckUtils]: 78: Hoare triple {25006#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {25006#(< ~counter~0 10)} is VALID [2022-04-08 05:46:30,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {25016#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25006#(< ~counter~0 10)} is VALID [2022-04-08 05:46:30,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {25016#(< ~counter~0 9)} ~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; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,440 INFO L290 TraceCheckUtils]: 75: Hoare triple {25016#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,440 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #92#return; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,458 INFO L272 TraceCheckUtils]: 70: Hoare triple {25016#(< ~counter~0 9)} 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)); {24706#true} is VALID [2022-04-08 05:46:30,459 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #90#return; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,459 INFO L290 TraceCheckUtils]: 68: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,459 INFO L290 TraceCheckUtils]: 67: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,459 INFO L272 TraceCheckUtils]: 65: Hoare triple {25016#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #88#return; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,460 INFO L290 TraceCheckUtils]: 63: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L272 TraceCheckUtils]: 60: Hoare triple {25016#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24706#true} {25016#(< ~counter~0 9)} #86#return; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,461 INFO L272 TraceCheckUtils]: 55: Hoare triple {25016#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {25016#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {25089#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25016#(< ~counter~0 9)} is VALID [2022-04-08 05:46:30,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {25089#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,465 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #92#return; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,466 INFO L272 TraceCheckUtils]: 47: Hoare triple {25089#(< ~counter~0 8)} 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)); {24706#true} is VALID [2022-04-08 05:46:30,466 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #90#return; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,467 INFO L272 TraceCheckUtils]: 42: Hoare triple {25089#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,467 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #88#return; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,467 INFO L290 TraceCheckUtils]: 38: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,467 INFO L272 TraceCheckUtils]: 37: Hoare triple {25089#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,468 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24706#true} {25089#(< ~counter~0 8)} #86#return; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,468 INFO L272 TraceCheckUtils]: 32: Hoare triple {25089#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,468 INFO L290 TraceCheckUtils]: 31: Hoare triple {25089#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {25159#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25089#(< ~counter~0 8)} is VALID [2022-04-08 05:46:30,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {25159#(< ~counter~0 7)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {25159#(< ~counter~0 7)} is VALID [2022-04-08 05:46:30,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {25159#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {25159#(< ~counter~0 7)} is VALID [2022-04-08 05:46:30,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {25169#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25159#(< ~counter~0 7)} is VALID [2022-04-08 05:46:30,470 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #84#return; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,470 INFO L290 TraceCheckUtils]: 25: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,470 INFO L272 TraceCheckUtils]: 22: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,470 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #82#return; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,475 INFO L272 TraceCheckUtils]: 17: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {25169#(< ~counter~0 6)} ~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; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,476 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #80#return; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,477 INFO L272 TraceCheckUtils]: 11: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,477 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24706#true} {25169#(< ~counter~0 6)} #78#return; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {24706#true} assume true; {24706#true} is VALID [2022-04-08 05:46:30,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {24706#true} assume !(0 == ~cond); {24706#true} is VALID [2022-04-08 05:46:30,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {24706#true} ~cond := #in~cond; {24706#true} is VALID [2022-04-08 05:46:30,477 INFO L272 TraceCheckUtils]: 6: Hoare triple {25169#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {24706#true} is VALID [2022-04-08 05:46:30,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {25169#(< ~counter~0 6)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {25169#(< ~counter~0 6)} call #t~ret8 := main(); {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25169#(< ~counter~0 6)} {24706#true} #98#return; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {25169#(< ~counter~0 6)} assume true; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {24706#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {25169#(< ~counter~0 6)} is VALID [2022-04-08 05:46:30,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {24706#true} call ULTIMATE.init(); {24706#true} is VALID [2022-04-08 05:46:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-04-08 05:46:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:46:30,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910141318] [2022-04-08 05:46:30,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:46:30,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900292201] [2022-04-08 05:46:30,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900292201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:46:30,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:46:30,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 05:46:30,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:46:30,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203046259] [2022-04-08 05:46:30,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203046259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:46:30,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:46:30,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:46:30,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495672286] [2022-04-08 05:46:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:46:30,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-08 05:46:30,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:46:30,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:30,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:30,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:46:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:30,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:46:30,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:46:30,533 INFO L87 Difference]: Start difference. First operand 293 states and 404 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:31,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:31,384 INFO L93 Difference]: Finished difference Result 463 states and 647 transitions. [2022-04-08 05:46:31,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 05:46:31,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 89 [2022-04-08 05:46:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:46:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-08 05:46:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 133 transitions. [2022-04-08 05:46:31,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 133 transitions. [2022-04-08 05:46:31,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:31,500 INFO L225 Difference]: With dead ends: 463 [2022-04-08 05:46:31,500 INFO L226 Difference]: Without dead ends: 329 [2022-04-08 05:46:31,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-08 05:46:31,502 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 44 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:46:31,502 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 171 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:46:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-04-08 05:46:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2022-04-08 05:46:31,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:46:31,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:46:31,970 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:46:31,970 INFO L87 Difference]: Start difference. First operand 329 states. Second operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:46:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:31,976 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-08 05:46:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-08 05:46:31,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:31,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:31,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-08 05:46:31,978 INFO L87 Difference]: Start difference. First operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 329 states. [2022-04-08 05:46:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:46:31,984 INFO L93 Difference]: Finished difference Result 329 states and 435 transitions. [2022-04-08 05:46:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 435 transitions. [2022-04-08 05:46:31,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:46:31,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:46:31,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:46:31,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:46:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 214 states have internal predecessors, (256), 90 states have call successors, (90), 30 states have call predecessors, (90), 29 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:46:31,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 433 transitions. [2022-04-08 05:46:31,992 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 433 transitions. Word has length 89 [2022-04-08 05:46:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:46:31,992 INFO L478 AbstractCegarLoop]: Abstraction has 327 states and 433 transitions. [2022-04-08 05:46:31,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2022-04-08 05:46:31,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 433 transitions. [2022-04-08 05:46:32,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:46:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 433 transitions. [2022-04-08 05:46:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-08 05:46:32,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:46:32,683 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 05:46:32,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 05:46:32,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 05:46:32,899 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:46:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:46:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 1 times [2022-04-08 05:46:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:46:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [319626156] [2022-04-08 05:46:32,900 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:46:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1415088729, now seen corresponding path program 2 times [2022-04-08 05:46:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:46:32,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897705998] [2022-04-08 05:46:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:46:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:46:32,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:46:32,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189155441] [2022-04-08 05:46:32,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:46:32,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:46:32,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:46:32,932 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:46:32,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 05:46:33,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:46:33,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:46:33,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjunts are in the unsatisfiable core [2022-04-08 05:46:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:46:33,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:46:36,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {27497#true} call ULTIMATE.init(); {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {27497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27497#true} {27497#true} #98#return; {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {27497#true} call #t~ret8 := main(); {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {27497#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {27497#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27497#true} {27497#true} #78#return; {27497#true} is VALID [2022-04-08 05:46:36,983 INFO L272 TraceCheckUtils]: 11: Hoare triple {27497#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {27497#true} is VALID [2022-04-08 05:46:36,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {27497#true} ~cond := #in~cond; {27538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:46:36,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {27538#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:36,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {27542#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27542#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:46:36,984 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {27542#(not (= |assume_abort_if_not_#in~cond| 0))} {27497#true} #80#return; {27549#(<= 1 main_~y~0)} is VALID [2022-04-08 05:46:36,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {27549#(<= 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; {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,984 INFO L272 TraceCheckUtils]: 17: Hoare triple {27553#(and (= main_~r~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) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-08 05:46:36,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,985 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {27497#true} {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #82#return; {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,985 INFO L272 TraceCheckUtils]: 22: Hoare triple {27553#(and (= main_~r~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) (<= 1 main_~y~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)); {27497#true} is VALID [2022-04-08 05:46:36,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,986 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27497#true} {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #84#return; {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {27553#(and (= main_~r~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {27553#(and (= main_~r~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) (<= 1 main_~y~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; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,989 INFO L272 TraceCheckUtils]: 32: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27497#true} is VALID [2022-04-08 05:46:36,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,990 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27497#true} {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,990 INFO L272 TraceCheckUtils]: 37: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {27497#true} is VALID [2022-04-08 05:46:36,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,991 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27497#true} {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #88#return; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,991 INFO L272 TraceCheckUtils]: 42: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {27497#true} is VALID [2022-04-08 05:46:36,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,991 INFO L290 TraceCheckUtils]: 45: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,992 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27497#true} {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #90#return; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,992 INFO L272 TraceCheckUtils]: 47: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~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)); {27497#true} is VALID [2022-04-08 05:46:36,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,993 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {27497#true} {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #92#return; {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {27593#(and (= main_~r~0 0) (= main_~c~0 main_~a~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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:46:36,995 INFO L272 TraceCheckUtils]: 55: Hoare triple {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {27497#true} is VALID [2022-04-08 05:46:36,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:36,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:36,996 INFO L290 TraceCheckUtils]: 58: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:36,997 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27663#(and (= main_~r~0 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) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~a~0 main_~x~0))} #86#return; {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:46:36,997 INFO L272 TraceCheckUtils]: 60: Hoare triple {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 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)); {27497#true} is VALID [2022-04-08 05:46:36,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:36,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:36,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:36,998 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27497#true} {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:46:36,998 INFO L272 TraceCheckUtils]: 65: Hoare triple {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 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)); {27497#true} is VALID [2022-04-08 05:46:36,998 INFO L290 TraceCheckUtils]: 66: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:36,999 INFO L290 TraceCheckUtils]: 67: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:36,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:37,000 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:46:37,000 INFO L272 TraceCheckUtils]: 70: Hoare triple {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 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)); {27497#true} is VALID [2022-04-08 05:46:37,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:37,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:37,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:37,001 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} is VALID [2022-04-08 05:46:37,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {27687#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (<= main_~b~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !(~c~0 >= ~b~0); {27736#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))))} is VALID [2022-04-08 05:46:37,003 INFO L290 TraceCheckUtils]: 76: Hoare triple {27736#(and (= main_~r~0 0) (<= main_~y~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (< main_~c~0 main_~y~0) (= main_~s~0 1) (= main_~k~0 1) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (= main_~x~0 (+ main_~c~0 (* main_~k~0 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; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,003 INFO L290 TraceCheckUtils]: 77: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,004 INFO L290 TraceCheckUtils]: 78: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,004 INFO L290 TraceCheckUtils]: 79: Hoare triple {27740#(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_~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; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,005 INFO L290 TraceCheckUtils]: 80: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,005 INFO L290 TraceCheckUtils]: 81: Hoare triple {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,005 INFO L272 TraceCheckUtils]: 82: Hoare triple {27740#(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_~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)); {27497#true} is VALID [2022-04-08 05:46:37,005 INFO L290 TraceCheckUtils]: 83: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:37,005 INFO L290 TraceCheckUtils]: 84: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:37,005 INFO L290 TraceCheckUtils]: 85: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:37,006 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {27497#true} {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #86#return; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,006 INFO L272 TraceCheckUtils]: 87: Hoare triple {27740#(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_~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)); {27497#true} is VALID [2022-04-08 05:46:37,006 INFO L290 TraceCheckUtils]: 88: Hoare triple {27497#true} ~cond := #in~cond; {27497#true} is VALID [2022-04-08 05:46:37,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {27497#true} assume !(0 == ~cond); {27497#true} is VALID [2022-04-08 05:46:37,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {27497#true} assume true; {27497#true} is VALID [2022-04-08 05:46:37,007 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {27497#true} {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #88#return; {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,007 INFO L272 TraceCheckUtils]: 92: Hoare triple {27740#(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_~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)); {27497#true} is VALID [2022-04-08 05:46:37,007 INFO L290 TraceCheckUtils]: 93: Hoare triple {27497#true} ~cond := #in~cond; {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:37,008 INFO L290 TraceCheckUtils]: 94: Hoare triple {27676#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:37,008 INFO L290 TraceCheckUtils]: 95: Hoare triple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:46:37,009 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {27680#(not (= |__VERIFIER_assert_#in~cond| 0))} {27740#(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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} #90#return; {27801#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ 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_~s~0 1) 0) (= main_~xy~0 (* main_~y~0 main_~x~0)) (<= main_~y~0 main_~x~0))} is VALID [2022-04-08 05:46:37,011 INFO L272 TraceCheckUtils]: 97: Hoare triple {27801#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ 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_~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)); {27805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:46:37,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {27805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:46:37,012 INFO L290 TraceCheckUtils]: 99: Hoare triple {27809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27498#false} is VALID [2022-04-08 05:46:37,012 INFO L290 TraceCheckUtils]: 100: Hoare triple {27498#false} assume !false; {27498#false} is VALID [2022-04-08 05:46:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 84 proven. 53 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-04-08 05:46:37,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:47:22,165 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:48:30,944 WARN L232 SmtUtils]: Spent 28.07s on a formula simplification that was a NOOP. DAG size: 28 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 05:48:44,735 WARN L232 SmtUtils]: Spent 10.30s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 05:48:44,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:48:44,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897705998] [2022-04-08 05:48:44,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:48:44,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189155441] [2022-04-08 05:48:44,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189155441] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:48:44,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:48:44,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 05:48:44,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:48:44,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [319626156] [2022-04-08 05:48:44,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [319626156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:48:44,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:48:44,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 05:48:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079534576] [2022-04-08 05:48:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:48:44,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-08 05:48:44,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:48:44,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:48:44,812 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-08 05:48:44,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 05:48:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:48:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 05:48:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2022-04-08 05:48:44,812 INFO L87 Difference]: Start difference. First operand 327 states and 433 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:48:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:58,899 INFO L93 Difference]: Finished difference Result 339 states and 443 transitions. [2022-04-08 05:48:58,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 05:48:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 101 [2022-04-08 05:48:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:48:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:48:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-08 05:48:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:48:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-04-08 05:48:58,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-04-08 05:48:59,027 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-08 05:48:59,033 INFO L225 Difference]: With dead ends: 339 [2022-04-08 05:48:59,033 INFO L226 Difference]: Without dead ends: 337 [2022-04-08 05:48:59,034 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=122, Invalid=527, Unknown=1, NotChecked=0, Total=650 [2022-04-08 05:48:59,034 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 57 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:48:59,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 315 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-08 05:48:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-08 05:48:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-04-08 05:48:59,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:48:59,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:48:59,663 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:48:59,664 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:48:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:59,669 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-08 05:48:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-08 05:48:59,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:48:59,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:48:59,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-08 05:48:59,671 INFO L87 Difference]: Start difference. First operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 337 states. [2022-04-08 05:48:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:48:59,677 INFO L93 Difference]: Finished difference Result 337 states and 441 transitions. [2022-04-08 05:48:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 441 transitions. [2022-04-08 05:48:59,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:48:59,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:48:59,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:48:59,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:48:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 220 states have internal predecessors, (262), 90 states have call successors, (90), 32 states have call predecessors, (90), 31 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:48:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 439 transitions. [2022-04-08 05:48:59,684 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 439 transitions. Word has length 101 [2022-04-08 05:48:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:48:59,685 INFO L478 AbstractCegarLoop]: Abstraction has 335 states and 439 transitions. [2022-04-08 05:48:59,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:48:59,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 335 states and 439 transitions. [2022-04-08 05:49:00,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 439 transitions. [2022-04-08 05:49:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 05:49:00,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:00,195 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:49:00,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-08 05:49:00,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:00,402 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 5 times [2022-04-08 05:49:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:00,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [215287155] [2022-04-08 05:49:00,403 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1524088572, now seen corresponding path program 6 times [2022-04-08 05:49:00,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:00,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811315112] [2022-04-08 05:49:00,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:00,411 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:00,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517231884] [2022-04-08 05:49:00,412 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:49:00,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:00,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:00,422 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:00,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 05:49:00,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 05:49:00,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:00,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 05:49:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:00,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:00,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {29932#true} call ULTIMATE.init(); {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {29932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29932#true} {29932#true} #98#return; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {29932#true} call #t~ret8 := main(); {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {29932#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {29932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29932#true} {29932#true} #78#return; {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L272 TraceCheckUtils]: 11: Hoare triple {29932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29932#true} {29932#true} #80#return; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {29932#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; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L272 TraceCheckUtils]: 17: Hoare triple {29932#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29932#true} {29932#true} #82#return; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L272 TraceCheckUtils]: 22: Hoare triple {29932#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29932#true} {29932#true} #84#return; {29932#true} is VALID [2022-04-08 05:49:00,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {29932#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {29932#true} assume !!(#t~post6 < 10);havoc #t~post6; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {29932#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L272 TraceCheckUtils]: 32: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L272 TraceCheckUtils]: 37: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 39: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-08 05:49:00,783 INFO L272 TraceCheckUtils]: 42: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L272 TraceCheckUtils]: 47: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 48: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L272 TraceCheckUtils]: 55: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 57: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L272 TraceCheckUtils]: 60: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L272 TraceCheckUtils]: 65: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 67: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L272 TraceCheckUtils]: 70: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-08 05:49:00,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L272 TraceCheckUtils]: 78: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:00,786 INFO L290 TraceCheckUtils]: 79: Hoare triple {29932#true} ~cond := #in~cond; {30174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:00,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {30174#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:00,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:00,788 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} {29932#true} #86#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,788 INFO L272 TraceCheckUtils]: 83: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-08 05:49:00,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,789 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,789 INFO L272 TraceCheckUtils]: 88: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-08 05:49:00,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,789 INFO L290 TraceCheckUtils]: 90: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,790 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,790 INFO L272 TraceCheckUtils]: 93: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-08 05:49:00,790 INFO L290 TraceCheckUtils]: 94: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:00,790 INFO L290 TraceCheckUtils]: 95: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:00,790 INFO L290 TraceCheckUtils]: 96: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:00,791 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,793 INFO L290 TraceCheckUtils]: 98: Hoare triple {30185#(= 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; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,793 INFO L290 TraceCheckUtils]: 99: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,793 INFO L290 TraceCheckUtils]: 100: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:00,794 INFO L272 TraceCheckUtils]: 101: Hoare triple {30185#(= 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)); {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:00,794 INFO L290 TraceCheckUtils]: 102: Hoare triple {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:00,795 INFO L290 TraceCheckUtils]: 103: Hoare triple {30247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29933#false} is VALID [2022-04-08 05:49:00,795 INFO L290 TraceCheckUtils]: 104: Hoare triple {29933#false} assume !false; {29933#false} is VALID [2022-04-08 05:49:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 05:49:00,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:11,198 INFO L290 TraceCheckUtils]: 104: Hoare triple {29933#false} assume !false; {29933#false} is VALID [2022-04-08 05:49:11,198 INFO L290 TraceCheckUtils]: 103: Hoare triple {30247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29933#false} is VALID [2022-04-08 05:49:11,198 INFO L290 TraceCheckUtils]: 102: Hoare triple {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:11,199 INFO L272 TraceCheckUtils]: 101: Hoare triple {30185#(= 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)); {30243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:11,199 INFO L290 TraceCheckUtils]: 100: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,200 INFO L290 TraceCheckUtils]: 99: Hoare triple {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,206 INFO L290 TraceCheckUtils]: 98: Hoare triple {30185#(= 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; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,207 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #92#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,207 INFO L290 TraceCheckUtils]: 96: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,207 INFO L290 TraceCheckUtils]: 95: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,207 INFO L290 TraceCheckUtils]: 94: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,207 INFO L272 TraceCheckUtils]: 93: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-08 05:49:11,208 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #90#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,208 INFO L290 TraceCheckUtils]: 91: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,208 INFO L290 TraceCheckUtils]: 90: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,208 INFO L290 TraceCheckUtils]: 89: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,208 INFO L272 TraceCheckUtils]: 88: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-08 05:49:11,209 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {29932#true} {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} #88#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,209 INFO L290 TraceCheckUtils]: 86: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,209 INFO L290 TraceCheckUtils]: 85: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,209 INFO L290 TraceCheckUtils]: 84: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,209 INFO L272 TraceCheckUtils]: 83: Hoare triple {30185#(= 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)); {29932#true} is VALID [2022-04-08 05:49:11,210 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} {29932#true} #86#return; {30185#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-08 05:49:11,210 INFO L290 TraceCheckUtils]: 81: Hoare triple {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:11,210 INFO L290 TraceCheckUtils]: 80: Hoare triple {30329#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30178#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {29932#true} ~cond := #in~cond; {30329#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:49:11,211 INFO L272 TraceCheckUtils]: 78: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 77: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 76: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 75: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 73: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 72: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 71: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L272 TraceCheckUtils]: 70: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 68: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,211 INFO L290 TraceCheckUtils]: 66: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L272 TraceCheckUtils]: 65: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 61: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L272 TraceCheckUtils]: 60: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 58: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 56: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L272 TraceCheckUtils]: 55: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {29932#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {29932#true} is VALID [2022-04-08 05:49:11,212 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {29932#true} {29932#true} #92#return; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 50: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L272 TraceCheckUtils]: 47: Hoare triple {29932#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)); {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29932#true} {29932#true} #90#return; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L272 TraceCheckUtils]: 42: Hoare triple {29932#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29932#true} {29932#true} #88#return; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 40: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 39: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L290 TraceCheckUtils]: 38: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L272 TraceCheckUtils]: 37: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,213 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29932#true} {29932#true} #86#return; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L272 TraceCheckUtils]: 32: Hoare triple {29932#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {29932#true} assume !!(#t~post7 < 10);havoc #t~post7; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {29932#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {29932#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {29932#true} assume !!(#t~post6 < 10);havoc #t~post6; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {29932#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {29932#true} {29932#true} #84#return; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,214 INFO L272 TraceCheckUtils]: 22: Hoare triple {29932#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {29932#true} {29932#true} #82#return; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L272 TraceCheckUtils]: 17: Hoare triple {29932#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {29932#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; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29932#true} {29932#true} #80#return; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {29932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29932#true} {29932#true} #78#return; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {29932#true} assume !(0 == ~cond); {29932#true} is VALID [2022-04-08 05:49:11,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {29932#true} ~cond := #in~cond; {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L272 TraceCheckUtils]: 6: Hoare triple {29932#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {29932#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {29932#true} call #t~ret8 := main(); {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29932#true} {29932#true} #98#return; {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {29932#true} assume true; {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {29932#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {29932#true} call ULTIMATE.init(); {29932#true} is VALID [2022-04-08 05:49:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 05:49:11,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:11,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811315112] [2022-04-08 05:49:11,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517231884] [2022-04-08 05:49:11,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517231884] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:11,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:11,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-04-08 05:49:11,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:11,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [215287155] [2022-04-08 05:49:11,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [215287155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:11,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:11,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:49:11,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287817402] [2022-04-08 05:49:11,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-08 05:49:11,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:11,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:49:11,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:11,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:49:11,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:11,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:49:11,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 05:49:11,259 INFO L87 Difference]: Start difference. First operand 335 states and 439 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:49:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:11,963 INFO L93 Difference]: Finished difference Result 341 states and 444 transitions. [2022-04-08 05:49:11,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 05:49:11,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2022-04-08 05:49:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:49:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 05:49:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:49:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-08 05:49:11,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-08 05:49:12,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:12,013 INFO L225 Difference]: With dead ends: 341 [2022-04-08 05:49:12,013 INFO L226 Difference]: Without dead ends: 339 [2022-04-08 05:49:12,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-04-08 05:49:12,017 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:12,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:49:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-04-08 05:49:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-04-08 05:49:12,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:12,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:12,625 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:12,625 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:12,661 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-08 05:49:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-08 05:49:12,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:12,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:12,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-08 05:49:12,663 INFO L87 Difference]: Start difference. First operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 339 states. [2022-04-08 05:49:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:12,669 INFO L93 Difference]: Finished difference Result 339 states and 442 transitions. [2022-04-08 05:49:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-08 05:49:12,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:12,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:12,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:12,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:12,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 216 states have (on average 1.2268518518518519) internal successors, (265), 223 states have internal predecessors, (265), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2022-04-08 05:49:12,693 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 105 [2022-04-08 05:49:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:12,693 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2022-04-08 05:49:12,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 05:49:12,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 339 states and 442 transitions. [2022-04-08 05:49:13,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2022-04-08 05:49:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-08 05:49:13,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:13,282 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 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] [2022-04-08 05:49:13,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:13,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:13,482 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 3 times [2022-04-08 05:49:13,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:13,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476280322] [2022-04-08 05:49:13,483 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:13,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1026601615, now seen corresponding path program 4 times [2022-04-08 05:49:13,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:13,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366656614] [2022-04-08 05:49:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:13,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:13,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:13,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [989813167] [2022-04-08 05:49:13,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:49:13,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:13,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:13,514 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:13,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 05:49:13,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:49:13,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:13,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 05:49:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:13,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:14,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {32611#true} call ULTIMATE.init(); {32611#true} is VALID [2022-04-08 05:49:14,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {32611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32619#(<= ~counter~0 0)} {32611#true} #98#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {32619#(<= ~counter~0 0)} call #t~ret8 := main(); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {32619#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #78#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,021 INFO L272 TraceCheckUtils]: 11: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,022 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #80#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {32619#(<= ~counter~0 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; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,023 INFO L272 TraceCheckUtils]: 17: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,024 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #82#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,024 INFO L272 TraceCheckUtils]: 22: Hoare triple {32619#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {32619#(<= ~counter~0 0)} ~cond := #in~cond; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {32619#(<= ~counter~0 0)} assume !(0 == ~cond); {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {32619#(<= ~counter~0 0)} assume true; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,025 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32619#(<= ~counter~0 0)} {32619#(<= ~counter~0 0)} #84#return; {32619#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:14,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {32619#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32698#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:14,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {32698#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {32698#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:14,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {32698#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {32698#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:14,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {32698#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {32708#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,028 INFO L272 TraceCheckUtils]: 32: Hoare triple {32708#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,029 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #86#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,030 INFO L272 TraceCheckUtils]: 37: Hoare triple {32708#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,031 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #88#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,032 INFO L272 TraceCheckUtils]: 42: Hoare triple {32708#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,033 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #90#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,034 INFO L272 TraceCheckUtils]: 47: Hoare triple {32708#(<= ~counter~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)); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {32708#(<= ~counter~0 2)} ~cond := #in~cond; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {32708#(<= ~counter~0 2)} assume !(0 == ~cond); {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,034 INFO L290 TraceCheckUtils]: 50: Hoare triple {32708#(<= ~counter~0 2)} assume true; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,035 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32708#(<= ~counter~0 2)} {32708#(<= ~counter~0 2)} #92#return; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {32708#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32708#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:14,036 INFO L290 TraceCheckUtils]: 53: Hoare triple {32708#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,036 INFO L290 TraceCheckUtils]: 54: Hoare triple {32778#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,036 INFO L272 TraceCheckUtils]: 55: Hoare triple {32778#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,037 INFO L290 TraceCheckUtils]: 56: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,038 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #86#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,038 INFO L272 TraceCheckUtils]: 60: Hoare triple {32778#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,040 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #88#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,040 INFO L272 TraceCheckUtils]: 65: Hoare triple {32778#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,042 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #90#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,042 INFO L272 TraceCheckUtils]: 70: Hoare triple {32778#(<= ~counter~0 3)} 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)); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,042 INFO L290 TraceCheckUtils]: 71: Hoare triple {32778#(<= ~counter~0 3)} ~cond := #in~cond; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {32778#(<= ~counter~0 3)} assume !(0 == ~cond); {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,043 INFO L290 TraceCheckUtils]: 73: Hoare triple {32778#(<= ~counter~0 3)} assume true; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,044 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32778#(<= ~counter~0 3)} {32778#(<= ~counter~0 3)} #92#return; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {32778#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {32778#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:14,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {32778#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {32848#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,045 INFO L272 TraceCheckUtils]: 78: Hoare triple {32848#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,046 INFO L290 TraceCheckUtils]: 80: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,046 INFO L290 TraceCheckUtils]: 81: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,046 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #86#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,047 INFO L272 TraceCheckUtils]: 83: Hoare triple {32848#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,047 INFO L290 TraceCheckUtils]: 84: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,047 INFO L290 TraceCheckUtils]: 85: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,048 INFO L290 TraceCheckUtils]: 86: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,048 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #88#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,049 INFO L272 TraceCheckUtils]: 88: Hoare triple {32848#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,049 INFO L290 TraceCheckUtils]: 89: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,049 INFO L290 TraceCheckUtils]: 90: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,049 INFO L290 TraceCheckUtils]: 91: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,050 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #90#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,051 INFO L272 TraceCheckUtils]: 93: Hoare triple {32848#(<= ~counter~0 4)} 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)); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,051 INFO L290 TraceCheckUtils]: 94: Hoare triple {32848#(<= ~counter~0 4)} ~cond := #in~cond; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,051 INFO L290 TraceCheckUtils]: 95: Hoare triple {32848#(<= ~counter~0 4)} assume !(0 == ~cond); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,051 INFO L290 TraceCheckUtils]: 96: Hoare triple {32848#(<= ~counter~0 4)} assume true; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,052 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32848#(<= ~counter~0 4)} {32848#(<= ~counter~0 4)} #92#return; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,052 INFO L290 TraceCheckUtils]: 98: Hoare triple {32848#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {32848#(<= ~counter~0 4)} ~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; {32848#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:14,053 INFO L290 TraceCheckUtils]: 100: Hoare triple {32848#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32921#(<= |main_#t~post6| 4)} is VALID [2022-04-08 05:49:14,054 INFO L290 TraceCheckUtils]: 101: Hoare triple {32921#(<= |main_#t~post6| 4)} assume !(#t~post6 < 10);havoc #t~post6; {32612#false} is VALID [2022-04-08 05:49:14,054 INFO L272 TraceCheckUtils]: 102: Hoare triple {32612#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32612#false} is VALID [2022-04-08 05:49:14,054 INFO L290 TraceCheckUtils]: 103: Hoare triple {32612#false} ~cond := #in~cond; {32612#false} is VALID [2022-04-08 05:49:14,054 INFO L290 TraceCheckUtils]: 104: Hoare triple {32612#false} assume 0 == ~cond; {32612#false} is VALID [2022-04-08 05:49:14,054 INFO L290 TraceCheckUtils]: 105: Hoare triple {32612#false} assume !false; {32612#false} is VALID [2022-04-08 05:49:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 215 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-08 05:49:14,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:14,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {32612#false} assume !false; {32612#false} is VALID [2022-04-08 05:49:14,430 INFO L290 TraceCheckUtils]: 104: Hoare triple {32612#false} assume 0 == ~cond; {32612#false} is VALID [2022-04-08 05:49:14,430 INFO L290 TraceCheckUtils]: 103: Hoare triple {32612#false} ~cond := #in~cond; {32612#false} is VALID [2022-04-08 05:49:14,430 INFO L272 TraceCheckUtils]: 102: Hoare triple {32612#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {32612#false} is VALID [2022-04-08 05:49:14,430 INFO L290 TraceCheckUtils]: 101: Hoare triple {32949#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {32612#false} is VALID [2022-04-08 05:49:14,430 INFO L290 TraceCheckUtils]: 100: Hoare triple {32953#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32949#(< |main_#t~post6| 10)} is VALID [2022-04-08 05:49:14,431 INFO L290 TraceCheckUtils]: 99: Hoare triple {32953#(< ~counter~0 10)} ~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; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,431 INFO L290 TraceCheckUtils]: 98: Hoare triple {32953#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,432 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #92#return; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,432 INFO L290 TraceCheckUtils]: 96: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,432 INFO L290 TraceCheckUtils]: 95: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,432 INFO L290 TraceCheckUtils]: 94: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,432 INFO L272 TraceCheckUtils]: 93: Hoare triple {32953#(< ~counter~0 10)} 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)); {32611#true} is VALID [2022-04-08 05:49:14,432 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #90#return; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,433 INFO L290 TraceCheckUtils]: 91: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,433 INFO L290 TraceCheckUtils]: 90: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,433 INFO L290 TraceCheckUtils]: 89: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,433 INFO L272 TraceCheckUtils]: 88: Hoare triple {32953#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,433 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #88#return; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,434 INFO L272 TraceCheckUtils]: 83: Hoare triple {32953#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,434 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {32611#true} {32953#(< ~counter~0 10)} #86#return; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,434 INFO L290 TraceCheckUtils]: 81: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,434 INFO L290 TraceCheckUtils]: 80: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,434 INFO L290 TraceCheckUtils]: 79: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,434 INFO L272 TraceCheckUtils]: 78: Hoare triple {32953#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,435 INFO L290 TraceCheckUtils]: 77: Hoare triple {32953#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,435 INFO L290 TraceCheckUtils]: 76: Hoare triple {33026#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32953#(< ~counter~0 10)} is VALID [2022-04-08 05:49:14,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {33026#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,436 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #92#return; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,436 INFO L290 TraceCheckUtils]: 73: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L290 TraceCheckUtils]: 71: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L272 TraceCheckUtils]: 70: Hoare triple {33026#(< ~counter~0 9)} 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)); {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #90#return; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,437 INFO L290 TraceCheckUtils]: 68: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L290 TraceCheckUtils]: 67: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L290 TraceCheckUtils]: 66: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,437 INFO L272 TraceCheckUtils]: 65: Hoare triple {33026#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,438 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #88#return; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,438 INFO L290 TraceCheckUtils]: 63: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,438 INFO L290 TraceCheckUtils]: 62: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,438 INFO L272 TraceCheckUtils]: 60: Hoare triple {33026#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,439 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {32611#true} {33026#(< ~counter~0 9)} #86#return; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,439 INFO L272 TraceCheckUtils]: 55: Hoare triple {33026#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {33026#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {33096#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33026#(< ~counter~0 9)} is VALID [2022-04-08 05:49:14,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {33096#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,441 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #92#return; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,441 INFO L272 TraceCheckUtils]: 47: Hoare triple {33096#(< ~counter~0 8)} 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)); {32611#true} is VALID [2022-04-08 05:49:14,441 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #90#return; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,442 INFO L272 TraceCheckUtils]: 42: Hoare triple {33096#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,442 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #88#return; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,443 INFO L272 TraceCheckUtils]: 37: Hoare triple {33096#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,443 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {32611#true} {33096#(< ~counter~0 8)} #86#return; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,443 INFO L272 TraceCheckUtils]: 32: Hoare triple {33096#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {33096#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {33166#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33096#(< ~counter~0 8)} is VALID [2022-04-08 05:49:14,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {33166#(< ~counter~0 7)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {33166#(< ~counter~0 7)} is VALID [2022-04-08 05:49:14,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {33166#(< ~counter~0 7)} assume !!(#t~post6 < 10);havoc #t~post6; {33166#(< ~counter~0 7)} is VALID [2022-04-08 05:49:14,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {33176#(< ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33166#(< ~counter~0 7)} is VALID [2022-04-08 05:49:14,446 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #84#return; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,446 INFO L272 TraceCheckUtils]: 22: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,446 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #82#return; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,447 INFO L272 TraceCheckUtils]: 17: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {33176#(< ~counter~0 6)} ~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; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #80#return; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,447 INFO L272 TraceCheckUtils]: 11: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,448 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32611#true} {33176#(< ~counter~0 6)} #78#return; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {32611#true} assume true; {32611#true} is VALID [2022-04-08 05:49:14,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {32611#true} assume !(0 == ~cond); {32611#true} is VALID [2022-04-08 05:49:14,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {32611#true} ~cond := #in~cond; {32611#true} is VALID [2022-04-08 05:49:14,448 INFO L272 TraceCheckUtils]: 6: Hoare triple {33176#(< ~counter~0 6)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {32611#true} is VALID [2022-04-08 05:49:14,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {33176#(< ~counter~0 6)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {33176#(< ~counter~0 6)} call #t~ret8 := main(); {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33176#(< ~counter~0 6)} {32611#true} #98#return; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {33176#(< ~counter~0 6)} assume true; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {32611#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {33176#(< ~counter~0 6)} is VALID [2022-04-08 05:49:14,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {32611#true} call ULTIMATE.init(); {32611#true} is VALID [2022-04-08 05:49:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 05:49:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366656614] [2022-04-08 05:49:14,450 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989813167] [2022-04-08 05:49:14,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989813167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:14,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:14,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 05:49:14,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476280322] [2022-04-08 05:49:14,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476280322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:14,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:14,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:49:14,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360733815] [2022-04-08 05:49:14,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-08 05:49:14,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:14,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:14,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:14,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:49:14,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:49:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:49:14,506 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:15,408 INFO L93 Difference]: Finished difference Result 349 states and 452 transitions. [2022-04-08 05:49:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 05:49:15,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 106 [2022-04-08 05:49:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-08 05:49:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2022-04-08 05:49:15,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2022-04-08 05:49:15,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:15,487 INFO L225 Difference]: With dead ends: 349 [2022-04-08 05:49:15,487 INFO L226 Difference]: Without dead ends: 342 [2022-04-08 05:49:15,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2022-04-08 05:49:15,488 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:15,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 177 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:49:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-08 05:49:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-04-08 05:49:15,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:15,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:15,987 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:15,987 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:15,992 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-08 05:49:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-08 05:49:15,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:15,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:15,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-08 05:49:15,994 INFO L87 Difference]: Start difference. First operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand 342 states. [2022-04-08 05:49:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:15,999 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2022-04-08 05:49:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-08 05:49:16,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:16,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:16,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:16,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 219 states have (on average 1.2237442922374429) internal successors, (268), 226 states have internal predecessors, (268), 90 states have call successors, (90), 33 states have call predecessors, (90), 32 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-04-08 05:49:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2022-04-08 05:49:16,008 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 106 [2022-04-08 05:49:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:16,008 INFO L478 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2022-04-08 05:49:16,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:16,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 342 states and 445 transitions. [2022-04-08 05:49:16,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 445 edges. 445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2022-04-08 05:49:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-08 05:49:16,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:16,621 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 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] [2022-04-08 05:49:16,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:16,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 05:49:16,821 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:16,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 3 times [2022-04-08 05:49:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:16,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039100570] [2022-04-08 05:49:16,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1761848073, now seen corresponding path program 4 times [2022-04-08 05:49:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:16,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120132558] [2022-04-08 05:49:16,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:16,834 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:16,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395768247] [2022-04-08 05:49:16,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:49:16,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:16,835 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:16,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 05:49:16,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:49:16,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:16,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 05:49:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:16,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:17,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {35332#true} call ULTIMATE.init(); {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {35332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35332#true} {35332#true} #98#return; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {35332#true} call #t~ret8 := main(); {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {35332#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L272 TraceCheckUtils]: 6: Hoare triple {35332#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35332#true} {35332#true} #78#return; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L272 TraceCheckUtils]: 11: Hoare triple {35332#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:17,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:17,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35332#true} {35332#true} #80#return; {35332#true} is VALID [2022-04-08 05:49:17,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {35332#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; {35385#(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-08 05:49:17,992 INFO L272 TraceCheckUtils]: 17: Hoare triple {35385#(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)); {35332#true} is VALID [2022-04-08 05:49:17,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,008 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {35332#true} {35385#(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))} #82#return; {35385#(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-08 05:49:18,008 INFO L272 TraceCheckUtils]: 22: Hoare triple {35385#(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)); {35332#true} is VALID [2022-04-08 05:49:18,008 INFO L290 TraceCheckUtils]: 23: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,008 INFO L290 TraceCheckUtils]: 25: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,009 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {35332#true} {35385#(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))} #84#return; {35385#(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-08 05:49:18,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {35385#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35385#(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-08 05:49:18,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {35385#(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 !!(#t~post6 < 10);havoc #t~post6; {35385#(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-08 05:49:18,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {35385#(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; {35425#(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-08 05:49:18,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {35425#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35425#(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-08 05:49:18,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {35425#(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 !!(#t~post7 < 10);havoc #t~post7; {35425#(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-08 05:49:18,011 INFO L272 TraceCheckUtils]: 32: Hoare triple {35425#(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)); {35332#true} is VALID [2022-04-08 05:49:18,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,012 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35332#true} {35425#(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))} #86#return; {35425#(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-08 05:49:18,012 INFO L272 TraceCheckUtils]: 37: Hoare triple {35425#(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)); {35332#true} is VALID [2022-04-08 05:49:18,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,013 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35332#true} {35425#(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))} #88#return; {35425#(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-08 05:49:18,013 INFO L272 TraceCheckUtils]: 42: Hoare triple {35425#(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)); {35332#true} is VALID [2022-04-08 05:49:18,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,013 INFO L290 TraceCheckUtils]: 44: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,013 INFO L290 TraceCheckUtils]: 45: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,014 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35332#true} {35425#(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))} #90#return; {35425#(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-08 05:49:18,014 INFO L272 TraceCheckUtils]: 47: Hoare triple {35425#(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)); {35332#true} is VALID [2022-04-08 05:49:18,014 INFO L290 TraceCheckUtils]: 48: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,015 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {35332#true} {35425#(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))} #92#return; {35425#(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-08 05:49:18,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {35425#(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; {35495#(and (= main_~r~0 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-08 05:49:18,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {35495#(and (= main_~r~0 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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35495#(and (= main_~r~0 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-08 05:49:18,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {35495#(and (= main_~r~0 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 !!(#t~post7 < 10);havoc #t~post7; {35495#(and (= main_~r~0 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-08 05:49:18,017 INFO L272 TraceCheckUtils]: 55: Hoare triple {35495#(and (= main_~r~0 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)); {35332#true} is VALID [2022-04-08 05:49:18,017 INFO L290 TraceCheckUtils]: 56: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,017 INFO L290 TraceCheckUtils]: 57: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,018 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 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))} #86#return; {35495#(and (= main_~r~0 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-08 05:49:18,018 INFO L272 TraceCheckUtils]: 60: Hoare triple {35495#(and (= main_~r~0 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)); {35332#true} is VALID [2022-04-08 05:49:18,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,019 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 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))} #88#return; {35495#(and (= main_~r~0 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-08 05:49:18,019 INFO L272 TraceCheckUtils]: 65: Hoare triple {35495#(and (= main_~r~0 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)); {35332#true} is VALID [2022-04-08 05:49:18,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,020 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 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))} #90#return; {35495#(and (= main_~r~0 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-08 05:49:18,020 INFO L272 TraceCheckUtils]: 70: Hoare triple {35495#(and (= main_~r~0 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)); {35332#true} is VALID [2022-04-08 05:49:18,020 INFO L290 TraceCheckUtils]: 71: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,020 INFO L290 TraceCheckUtils]: 73: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,021 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {35332#true} {35495#(and (= main_~r~0 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))} #92#return; {35495#(and (= main_~r~0 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-08 05:49:18,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {35495#(and (= main_~r~0 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; {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,023 INFO L272 TraceCheckUtils]: 78: Hoare triple {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~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)); {35332#true} is VALID [2022-04-08 05:49:18,023 INFO L290 TraceCheckUtils]: 79: Hoare triple {35332#true} ~cond := #in~cond; {35578#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:18,023 INFO L290 TraceCheckUtils]: 80: Hoare triple {35578#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:18,024 INFO L290 TraceCheckUtils]: 81: Hoare triple {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:18,025 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35582#(not (= |__VERIFIER_assert_#in~cond| 0))} {35565#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #86#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,025 INFO L272 TraceCheckUtils]: 83: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= 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)); {35332#true} is VALID [2022-04-08 05:49:18,025 INFO L290 TraceCheckUtils]: 84: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,025 INFO L290 TraceCheckUtils]: 85: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,025 INFO L290 TraceCheckUtils]: 86: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,026 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35332#true} {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #88#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,026 INFO L272 TraceCheckUtils]: 88: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= 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)); {35332#true} is VALID [2022-04-08 05:49:18,026 INFO L290 TraceCheckUtils]: 89: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,026 INFO L290 TraceCheckUtils]: 91: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,027 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {35332#true} {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #90#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,027 INFO L272 TraceCheckUtils]: 93: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= 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)); {35332#true} is VALID [2022-04-08 05:49:18,027 INFO L290 TraceCheckUtils]: 94: Hoare triple {35332#true} ~cond := #in~cond; {35332#true} is VALID [2022-04-08 05:49:18,027 INFO L290 TraceCheckUtils]: 95: Hoare triple {35332#true} assume !(0 == ~cond); {35332#true} is VALID [2022-04-08 05:49:18,027 INFO L290 TraceCheckUtils]: 96: Hoare triple {35332#true} assume true; {35332#true} is VALID [2022-04-08 05:49:18,028 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {35332#true} {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} #92#return; {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,028 INFO L290 TraceCheckUtils]: 98: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= 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); {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~x~0 (+ main_~c~0 (* main_~k~0 main_~y~0))) (= main_~p~0 1))} is VALID [2022-04-08 05:49:18,030 INFO L290 TraceCheckUtils]: 99: Hoare triple {35589#(and (= main_~r~0 0) (= main_~c~0 (+ main_~c~0 (* main_~k~0 main_~y~0) (* (- 2) main_~y~0))) (= main_~s~0 1) (= 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; {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-08 05:49:18,030 INFO L290 TraceCheckUtils]: 100: Hoare triple {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-08 05:49:18,031 INFO L290 TraceCheckUtils]: 101: Hoare triple {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-08 05:49:18,031 INFO L290 TraceCheckUtils]: 102: Hoare triple {35641#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !(0 != ~b~0); {35651#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} is VALID [2022-04-08 05:49:18,032 INFO L272 TraceCheckUtils]: 103: Hoare triple {35651#(and (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 (* (- 1) main_~s~0)) main_~x~0 (* main_~y~0 main_~s~0) (* (- 2) main_~y~0))) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {35655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:18,032 INFO L290 TraceCheckUtils]: 104: Hoare triple {35655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {35659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:18,032 INFO L290 TraceCheckUtils]: 105: Hoare triple {35659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {35333#false} is VALID [2022-04-08 05:49:18,032 INFO L290 TraceCheckUtils]: 106: Hoare triple {35333#false} assume !false; {35333#false} is VALID [2022-04-08 05:49:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 47 proven. 34 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2022-04-08 05:49:18,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:25,175 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:49:25,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:25,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120132558] [2022-04-08 05:49:25,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:25,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395768247] [2022-04-08 05:49:25,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395768247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:49:25,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:49:25,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 05:49:25,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:25,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039100570] [2022-04-08 05:49:25,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039100570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:25,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:25,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:49:25,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701690661] [2022-04-08 05:49:25,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:25,272 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-08 05:49:25,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:25,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 05:49:25,336 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-08 05:49:25,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:49:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:25,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:49:25,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 05:49:25,337 INFO L87 Difference]: Start difference. First operand 342 states and 445 transitions. Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 05:49:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:28,151 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2022-04-08 05:49:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:49:28,151 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) Word has length 107 [2022-04-08 05:49:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 05:49:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-08 05:49:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 05:49:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2022-04-08 05:49:28,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 125 transitions. [2022-04-08 05:49:28,286 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-08 05:49:28,293 INFO L225 Difference]: With dead ends: 369 [2022-04-08 05:49:28,294 INFO L226 Difference]: Without dead ends: 366 [2022-04-08 05:49:28,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-08 05:49:28,294 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:28,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 352 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 05:49:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-08 05:49:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2022-04-08 05:49:29,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:29,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-08 05:49:29,071 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-08 05:49:29,071 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-08 05:49:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:29,077 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-08 05:49:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-08 05:49:29,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:29,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:29,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-08 05:49:29,078 INFO L87 Difference]: Start difference. First operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) Second operand 366 states. [2022-04-08 05:49:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:29,084 INFO L93 Difference]: Finished difference Result 366 states and 481 transitions. [2022-04-08 05:49:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 481 transitions. [2022-04-08 05:49:29,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:29,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:29,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:29,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 231 states have (on average 1.2294372294372293) internal successors, (284), 239 states have internal predecessors, (284), 99 states have call successors, (99), 34 states have call predecessors, (99), 33 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2022-04-08 05:49:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 479 transitions. [2022-04-08 05:49:29,092 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 479 transitions. Word has length 107 [2022-04-08 05:49:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:29,093 INFO L478 AbstractCegarLoop]: Abstraction has 364 states and 479 transitions. [2022-04-08 05:49:29,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 7 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 5 states have call predecessors, (17), 6 states have call successors, (17) [2022-04-08 05:49:29,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 364 states and 479 transitions. [2022-04-08 05:49:29,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 479 transitions. [2022-04-08 05:49:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-08 05:49:29,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:29,767 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 05:49:29,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:29,967 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 05:49:29,967 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 5 times [2022-04-08 05:49:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249162122] [2022-04-08 05:49:29,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1514731471, now seen corresponding path program 6 times [2022-04-08 05:49:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516609198] [2022-04-08 05:49:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:29,977 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:29,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856398358] [2022-04-08 05:49:29,978 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:49:29,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:29,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:29,979 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:29,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 05:49:30,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:49:30,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:30,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 05:49:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:30,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:30,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {37950#true} call ULTIMATE.init(); {37950#true} is VALID [2022-04-08 05:49:30,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {37950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37958#(<= ~counter~0 0)} {37950#true} #98#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {37958#(<= ~counter~0 0)} call #t~ret8 := main(); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {37958#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #78#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,501 INFO L272 TraceCheckUtils]: 11: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,502 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #80#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {37958#(<= ~counter~0 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; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,502 INFO L272 TraceCheckUtils]: 17: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,503 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #82#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,504 INFO L272 TraceCheckUtils]: 22: Hoare triple {37958#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {37958#(<= ~counter~0 0)} ~cond := #in~cond; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {37958#(<= ~counter~0 0)} assume !(0 == ~cond); {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {37958#(<= ~counter~0 0)} assume true; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,505 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37958#(<= ~counter~0 0)} {37958#(<= ~counter~0 0)} #84#return; {37958#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {37958#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38037#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {38037#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {38037#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:30,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {38037#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38037#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:30,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {38037#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {38047#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,507 INFO L272 TraceCheckUtils]: 32: Hoare triple {38047#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,508 INFO L290 TraceCheckUtils]: 34: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,508 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #86#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,509 INFO L272 TraceCheckUtils]: 37: Hoare triple {38047#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,510 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #88#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,510 INFO L272 TraceCheckUtils]: 42: Hoare triple {38047#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,511 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #90#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,512 INFO L272 TraceCheckUtils]: 47: Hoare triple {38047#(<= ~counter~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)); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {38047#(<= ~counter~0 2)} ~cond := #in~cond; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {38047#(<= ~counter~0 2)} assume !(0 == ~cond); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {38047#(<= ~counter~0 2)} assume true; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,513 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {38047#(<= ~counter~0 2)} {38047#(<= ~counter~0 2)} #92#return; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {38047#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {38047#(<= ~counter~0 2)} ~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; {38047#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {38047#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38120#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 55: Hoare triple {38120#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {38120#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:30,514 INFO L290 TraceCheckUtils]: 56: Hoare triple {38120#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38120#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:30,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {38120#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {38130#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,516 INFO L272 TraceCheckUtils]: 59: Hoare triple {38130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,516 INFO L290 TraceCheckUtils]: 62: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,517 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #86#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,517 INFO L272 TraceCheckUtils]: 64: Hoare triple {38130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,517 INFO L290 TraceCheckUtils]: 65: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,517 INFO L290 TraceCheckUtils]: 66: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,518 INFO L290 TraceCheckUtils]: 67: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,518 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #88#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,519 INFO L272 TraceCheckUtils]: 69: Hoare triple {38130#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,519 INFO L290 TraceCheckUtils]: 70: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,519 INFO L290 TraceCheckUtils]: 71: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,520 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #90#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,520 INFO L272 TraceCheckUtils]: 74: Hoare triple {38130#(<= ~counter~0 4)} 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)); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {38130#(<= ~counter~0 4)} ~cond := #in~cond; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,521 INFO L290 TraceCheckUtils]: 76: Hoare triple {38130#(<= ~counter~0 4)} assume !(0 == ~cond); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,521 INFO L290 TraceCheckUtils]: 77: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,522 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {38130#(<= ~counter~0 4)} {38130#(<= ~counter~0 4)} #92#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,522 INFO L290 TraceCheckUtils]: 79: Hoare triple {38130#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,523 INFO L290 TraceCheckUtils]: 80: Hoare triple {38130#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,523 INFO L290 TraceCheckUtils]: 81: Hoare triple {38200#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,524 INFO L272 TraceCheckUtils]: 82: Hoare triple {38200#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,524 INFO L290 TraceCheckUtils]: 83: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,524 INFO L290 TraceCheckUtils]: 84: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,524 INFO L290 TraceCheckUtils]: 85: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,525 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #86#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,525 INFO L272 TraceCheckUtils]: 87: Hoare triple {38200#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,526 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #88#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,527 INFO L272 TraceCheckUtils]: 92: Hoare triple {38200#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,527 INFO L290 TraceCheckUtils]: 93: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,527 INFO L290 TraceCheckUtils]: 94: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,527 INFO L290 TraceCheckUtils]: 95: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,528 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #90#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,528 INFO L272 TraceCheckUtils]: 97: Hoare triple {38200#(<= ~counter~0 5)} 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)); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,528 INFO L290 TraceCheckUtils]: 98: Hoare triple {38200#(<= ~counter~0 5)} ~cond := #in~cond; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,529 INFO L290 TraceCheckUtils]: 99: Hoare triple {38200#(<= ~counter~0 5)} assume !(0 == ~cond); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,529 INFO L290 TraceCheckUtils]: 100: Hoare triple {38200#(<= ~counter~0 5)} assume true; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,529 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {38200#(<= ~counter~0 5)} {38200#(<= ~counter~0 5)} #92#return; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,530 INFO L290 TraceCheckUtils]: 102: Hoare triple {38200#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,530 INFO L290 TraceCheckUtils]: 103: Hoare triple {38200#(<= ~counter~0 5)} ~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; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,530 INFO L290 TraceCheckUtils]: 104: Hoare triple {38200#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38273#(<= |main_#t~post6| 5)} is VALID [2022-04-08 05:49:30,530 INFO L290 TraceCheckUtils]: 105: Hoare triple {38273#(<= |main_#t~post6| 5)} assume !(#t~post6 < 10);havoc #t~post6; {37951#false} is VALID [2022-04-08 05:49:30,530 INFO L272 TraceCheckUtils]: 106: Hoare triple {37951#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {37951#false} is VALID [2022-04-08 05:49:30,531 INFO L290 TraceCheckUtils]: 107: Hoare triple {37951#false} ~cond := #in~cond; {37951#false} is VALID [2022-04-08 05:49:30,531 INFO L290 TraceCheckUtils]: 108: Hoare triple {37951#false} assume 0 == ~cond; {37951#false} is VALID [2022-04-08 05:49:30,531 INFO L290 TraceCheckUtils]: 109: Hoare triple {37951#false} assume !false; {37951#false} is VALID [2022-04-08 05:49:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 24 proven. 221 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-08 05:49:30,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:30,861 INFO L290 TraceCheckUtils]: 109: Hoare triple {37951#false} assume !false; {37951#false} is VALID [2022-04-08 05:49:30,861 INFO L290 TraceCheckUtils]: 108: Hoare triple {37951#false} assume 0 == ~cond; {37951#false} is VALID [2022-04-08 05:49:30,861 INFO L290 TraceCheckUtils]: 107: Hoare triple {37951#false} ~cond := #in~cond; {37951#false} is VALID [2022-04-08 05:49:30,861 INFO L272 TraceCheckUtils]: 106: Hoare triple {37951#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {37951#false} is VALID [2022-04-08 05:49:30,861 INFO L290 TraceCheckUtils]: 105: Hoare triple {38301#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {37951#false} is VALID [2022-04-08 05:49:30,862 INFO L290 TraceCheckUtils]: 104: Hoare triple {38305#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38301#(< |main_#t~post6| 10)} is VALID [2022-04-08 05:49:30,862 INFO L290 TraceCheckUtils]: 103: Hoare triple {38305#(< ~counter~0 10)} ~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; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,862 INFO L290 TraceCheckUtils]: 102: Hoare triple {38305#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,863 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #92#return; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,863 INFO L290 TraceCheckUtils]: 100: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,863 INFO L290 TraceCheckUtils]: 99: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,863 INFO L290 TraceCheckUtils]: 98: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,863 INFO L272 TraceCheckUtils]: 97: Hoare triple {38305#(< ~counter~0 10)} 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)); {37950#true} is VALID [2022-04-08 05:49:30,863 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #90#return; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,863 INFO L290 TraceCheckUtils]: 95: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,863 INFO L290 TraceCheckUtils]: 94: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,864 INFO L290 TraceCheckUtils]: 93: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,864 INFO L272 TraceCheckUtils]: 92: Hoare triple {38305#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,864 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #88#return; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,864 INFO L290 TraceCheckUtils]: 90: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,864 INFO L290 TraceCheckUtils]: 89: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,864 INFO L290 TraceCheckUtils]: 88: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,864 INFO L272 TraceCheckUtils]: 87: Hoare triple {38305#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,865 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {37950#true} {38305#(< ~counter~0 10)} #86#return; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,865 INFO L290 TraceCheckUtils]: 85: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,865 INFO L272 TraceCheckUtils]: 82: Hoare triple {38305#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {38305#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {38378#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38305#(< ~counter~0 10)} is VALID [2022-04-08 05:49:30,866 INFO L290 TraceCheckUtils]: 79: Hoare triple {38378#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,867 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #92#return; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,867 INFO L272 TraceCheckUtils]: 74: Hoare triple {38378#(< ~counter~0 9)} 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)); {37950#true} is VALID [2022-04-08 05:49:30,867 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #90#return; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,868 INFO L290 TraceCheckUtils]: 72: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L290 TraceCheckUtils]: 71: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L290 TraceCheckUtils]: 70: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L272 TraceCheckUtils]: 69: Hoare triple {38378#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #88#return; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,868 INFO L290 TraceCheckUtils]: 67: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L290 TraceCheckUtils]: 66: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,868 INFO L272 TraceCheckUtils]: 64: Hoare triple {38378#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,869 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {37950#true} {38378#(< ~counter~0 9)} #86#return; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,869 INFO L272 TraceCheckUtils]: 59: Hoare triple {38378#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {38378#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {38448#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38378#(< ~counter~0 9)} is VALID [2022-04-08 05:49:30,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {38448#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38448#(< ~counter~0 8)} is VALID [2022-04-08 05:49:30,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {38448#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {38448#(< ~counter~0 8)} is VALID [2022-04-08 05:49:30,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(< ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38448#(< ~counter~0 8)} is VALID [2022-04-08 05:49:30,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {38458#(< ~counter~0 7)} ~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; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {38458#(< ~counter~0 7)} assume !(~c~0 >= ~b~0); {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,872 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #92#return; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,872 INFO L272 TraceCheckUtils]: 47: Hoare triple {38458#(< ~counter~0 7)} 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)); {37950#true} is VALID [2022-04-08 05:49:30,872 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #90#return; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L272 TraceCheckUtils]: 42: Hoare triple {38458#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #88#return; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,873 INFO L272 TraceCheckUtils]: 37: Hoare triple {38458#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,874 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37950#true} {38458#(< ~counter~0 7)} #86#return; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,874 INFO L272 TraceCheckUtils]: 32: Hoare triple {38458#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {38458#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {38200#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38458#(< ~counter~0 7)} is VALID [2022-04-08 05:49:30,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {38200#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {38200#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {38130#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38200#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:30,876 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #84#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,876 INFO L272 TraceCheckUtils]: 22: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,877 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #82#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,877 INFO L272 TraceCheckUtils]: 17: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {38130#(<= ~counter~0 4)} ~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; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #80#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L272 TraceCheckUtils]: 11: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37950#true} {38130#(<= ~counter~0 4)} #78#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {37950#true} assume true; {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {37950#true} assume !(0 == ~cond); {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {37950#true} ~cond := #in~cond; {37950#true} is VALID [2022-04-08 05:49:30,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {38130#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37950#true} is VALID [2022-04-08 05:49:30,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {38130#(<= ~counter~0 4)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {38130#(<= ~counter~0 4)} call #t~ret8 := main(); {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38130#(<= ~counter~0 4)} {37950#true} #98#return; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {38130#(<= ~counter~0 4)} assume true; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {37950#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {38130#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:30,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {37950#true} call ULTIMATE.init(); {37950#true} is VALID [2022-04-08 05:49:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 05:49:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:30,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516609198] [2022-04-08 05:49:30,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:30,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856398358] [2022-04-08 05:49:30,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856398358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:30,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:30,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 05:49:30,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:30,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249162122] [2022-04-08 05:49:30,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249162122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:30,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:30,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:49:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071783672] [2022-04-08 05:49:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:30,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 110 [2022-04-08 05:49:30,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:30,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:30,932 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-08 05:49:30,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:49:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:30,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:49:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:49:30,933 INFO L87 Difference]: Start difference. First operand 364 states and 479 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:31,955 INFO L93 Difference]: Finished difference Result 434 states and 549 transitions. [2022-04-08 05:49:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:49:31,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 110 [2022-04-08 05:49:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-08 05:49:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2022-04-08 05:49:31,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2022-04-08 05:49:32,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:32,068 INFO L225 Difference]: With dead ends: 434 [2022-04-08 05:49:32,068 INFO L226 Difference]: Without dead ends: 425 [2022-04-08 05:49:32,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-08 05:49:32,069 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:32,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 185 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:49:32,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-04-08 05:49:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2022-04-08 05:49:32,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:32,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 425 states. Second operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 05:49:32,652 INFO L74 IsIncluded]: Start isIncluded. First operand 425 states. Second operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 05:49:32,653 INFO L87 Difference]: Start difference. First operand 425 states. Second operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 05:49:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:32,660 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-08 05:49:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-08 05:49:32,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:32,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:32,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand 425 states. [2022-04-08 05:49:32,662 INFO L87 Difference]: Start difference. First operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) Second operand 425 states. [2022-04-08 05:49:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:32,670 INFO L93 Difference]: Finished difference Result 425 states and 538 transitions. [2022-04-08 05:49:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 538 transitions. [2022-04-08 05:49:32,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:32,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:32,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:32,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 272 states have (on average 1.2022058823529411) internal successors, (327), 279 states have internal predecessors, (327), 106 states have call successors, (106), 45 states have call predecessors, (106), 44 states have return successors, (103), 98 states have call predecessors, (103), 103 states have call successors, (103) [2022-04-08 05:49:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 536 transitions. [2022-04-08 05:49:32,681 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 536 transitions. Word has length 110 [2022-04-08 05:49:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:32,681 INFO L478 AbstractCegarLoop]: Abstraction has 423 states and 536 transitions. [2022-04-08 05:49:32,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:32,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 423 states and 536 transitions. [2022-04-08 05:49:33,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 536 transitions. [2022-04-08 05:49:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-08 05:49:33,495 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:33,495 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 3, 3, 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] [2022-04-08 05:49:33,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-08 05:49:33,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 05:49:33,696 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 5 times [2022-04-08 05:49:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:33,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417313689] [2022-04-08 05:49:33,697 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:33,697 INFO L85 PathProgramCache]: Analyzing trace with hash -289933735, now seen corresponding path program 6 times [2022-04-08 05:49:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:33,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582628676] [2022-04-08 05:49:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:33,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:33,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773205623] [2022-04-08 05:49:33,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:49:33,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:33,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:33,724 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:33,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 05:49:33,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:49:33,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:33,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 05:49:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:33,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:34,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #98#return; {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret8 := main(); {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L272 TraceCheckUtils]: 6: Hoare triple {41195#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41195#true} {41195#true} #78#return; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {41195#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41195#true} {41195#true} #80#return; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {41195#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; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L272 TraceCheckUtils]: 17: Hoare triple {41195#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41195#true} {41195#true} #82#return; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L272 TraceCheckUtils]: 22: Hoare triple {41195#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 25: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41195#true} {41195#true} #84#return; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {41195#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {41195#true} assume !!(#t~post6 < 10);havoc #t~post6; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {41195#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {41195#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {41195#true} assume !!(#t~post7 < 10);havoc #t~post7; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L272 TraceCheckUtils]: 32: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41195#true} {41195#true} #86#return; {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L272 TraceCheckUtils]: 37: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41195#true} {41195#true} #88#return; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L272 TraceCheckUtils]: 42: Hoare triple {41195#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41195#true} {41195#true} #90#return; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L272 TraceCheckUtils]: 47: Hoare triple {41195#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)); {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 49: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L290 TraceCheckUtils]: 50: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,054 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41195#true} {41195#true} #92#return; {41195#true} is VALID [2022-04-08 05:49:34,055 INFO L290 TraceCheckUtils]: 52: Hoare triple {41195#true} assume !(~c~0 >= ~b~0); {41356#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:49:34,055 INFO L290 TraceCheckUtils]: 53: Hoare triple {41356#(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; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:34,055 INFO L290 TraceCheckUtils]: 54: Hoare triple {41360#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:34,055 INFO L290 TraceCheckUtils]: 55: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:34,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {41370#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,056 INFO L272 TraceCheckUtils]: 59: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,056 INFO L290 TraceCheckUtils]: 60: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,056 INFO L290 TraceCheckUtils]: 62: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,057 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #86#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,057 INFO L272 TraceCheckUtils]: 64: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,057 INFO L290 TraceCheckUtils]: 65: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,057 INFO L290 TraceCheckUtils]: 66: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,057 INFO L290 TraceCheckUtils]: 67: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,057 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #88#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,057 INFO L272 TraceCheckUtils]: 69: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L290 TraceCheckUtils]: 70: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L290 TraceCheckUtils]: 71: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L290 TraceCheckUtils]: 72: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #90#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,058 INFO L272 TraceCheckUtils]: 74: Hoare triple {41370#(< 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)); {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L290 TraceCheckUtils]: 75: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L290 TraceCheckUtils]: 76: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,058 INFO L290 TraceCheckUtils]: 77: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,059 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #92#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,060 INFO L290 TraceCheckUtils]: 79: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,060 INFO L290 TraceCheckUtils]: 80: Hoare triple {41440#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,060 INFO L290 TraceCheckUtils]: 81: Hoare triple {41440#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,060 INFO L272 TraceCheckUtils]: 82: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,060 INFO L290 TraceCheckUtils]: 83: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,060 INFO L290 TraceCheckUtils]: 84: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,060 INFO L290 TraceCheckUtils]: 85: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,061 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #86#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,061 INFO L272 TraceCheckUtils]: 87: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,061 INFO L290 TraceCheckUtils]: 88: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,061 INFO L290 TraceCheckUtils]: 89: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,061 INFO L290 TraceCheckUtils]: 90: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,061 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #88#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,062 INFO L272 TraceCheckUtils]: 92: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L290 TraceCheckUtils]: 93: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L290 TraceCheckUtils]: 94: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L290 TraceCheckUtils]: 95: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #90#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,062 INFO L272 TraceCheckUtils]: 97: Hoare triple {41440#(< 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)); {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L290 TraceCheckUtils]: 98: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L290 TraceCheckUtils]: 99: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,062 INFO L290 TraceCheckUtils]: 100: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,063 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #92#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,063 INFO L290 TraceCheckUtils]: 102: Hoare triple {41440#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,063 INFO L290 TraceCheckUtils]: 103: Hoare triple {41440#(< 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; {41513#(< 0 main_~b~0)} is VALID [2022-04-08 05:49:34,064 INFO L290 TraceCheckUtils]: 104: Hoare triple {41513#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-08 05:49:34,064 INFO L290 TraceCheckUtils]: 105: Hoare triple {41513#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-08 05:49:34,064 INFO L290 TraceCheckUtils]: 106: Hoare triple {41513#(< 0 main_~b~0)} assume !(0 != ~b~0); {41196#false} is VALID [2022-04-08 05:49:34,064 INFO L272 TraceCheckUtils]: 107: Hoare triple {41196#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41196#false} is VALID [2022-04-08 05:49:34,064 INFO L290 TraceCheckUtils]: 108: Hoare triple {41196#false} ~cond := #in~cond; {41196#false} is VALID [2022-04-08 05:49:34,064 INFO L290 TraceCheckUtils]: 109: Hoare triple {41196#false} assume 0 == ~cond; {41196#false} is VALID [2022-04-08 05:49:34,064 INFO L290 TraceCheckUtils]: 110: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-08 05:49:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 05:49:34,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:34,332 INFO L290 TraceCheckUtils]: 110: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-08 05:49:34,332 INFO L290 TraceCheckUtils]: 109: Hoare triple {41196#false} assume 0 == ~cond; {41196#false} is VALID [2022-04-08 05:49:34,332 INFO L290 TraceCheckUtils]: 108: Hoare triple {41196#false} ~cond := #in~cond; {41196#false} is VALID [2022-04-08 05:49:34,333 INFO L272 TraceCheckUtils]: 107: Hoare triple {41196#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {41196#false} is VALID [2022-04-08 05:49:34,333 INFO L290 TraceCheckUtils]: 106: Hoare triple {41513#(< 0 main_~b~0)} assume !(0 != ~b~0); {41196#false} is VALID [2022-04-08 05:49:34,333 INFO L290 TraceCheckUtils]: 105: Hoare triple {41513#(< 0 main_~b~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-08 05:49:34,333 INFO L290 TraceCheckUtils]: 104: Hoare triple {41513#(< 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41513#(< 0 main_~b~0)} is VALID [2022-04-08 05:49:34,334 INFO L290 TraceCheckUtils]: 103: Hoare triple {41440#(< 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; {41513#(< 0 main_~b~0)} is VALID [2022-04-08 05:49:34,334 INFO L290 TraceCheckUtils]: 102: Hoare triple {41440#(< 0 main_~c~0)} assume !(~c~0 >= ~b~0); {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,334 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #92#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,335 INFO L290 TraceCheckUtils]: 98: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,335 INFO L272 TraceCheckUtils]: 97: Hoare triple {41440#(< 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)); {41195#true} is VALID [2022-04-08 05:49:34,335 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #90#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,335 INFO L290 TraceCheckUtils]: 95: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,335 INFO L290 TraceCheckUtils]: 94: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,335 INFO L290 TraceCheckUtils]: 93: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,335 INFO L272 TraceCheckUtils]: 92: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,336 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #88#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,336 INFO L290 TraceCheckUtils]: 90: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,336 INFO L290 TraceCheckUtils]: 89: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,336 INFO L290 TraceCheckUtils]: 88: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,336 INFO L272 TraceCheckUtils]: 87: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,336 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {41195#true} {41440#(< 0 main_~c~0)} #86#return; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,337 INFO L290 TraceCheckUtils]: 84: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,337 INFO L290 TraceCheckUtils]: 83: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,337 INFO L272 TraceCheckUtils]: 82: Hoare triple {41440#(< 0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {41440#(< 0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {41440#(< 0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {41440#(< 0 main_~c~0)} is VALID [2022-04-08 05:49:34,339 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #92#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,339 INFO L272 TraceCheckUtils]: 74: Hoare triple {41370#(< 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)); {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #90#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L272 TraceCheckUtils]: 69: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #88#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,341 INFO L272 TraceCheckUtils]: 64: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,341 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41195#true} {41370#(< main_~b~0 main_~c~0)} #86#return; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,341 INFO L290 TraceCheckUtils]: 61: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,341 INFO L290 TraceCheckUtils]: 60: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,341 INFO L272 TraceCheckUtils]: 59: Hoare triple {41370#(< main_~b~0 main_~c~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,341 INFO L290 TraceCheckUtils]: 58: Hoare triple {41370#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 10);havoc #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {41370#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41370#(< main_~b~0 main_~c~0)} is VALID [2022-04-08 05:49:34,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {41360#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 10);havoc #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:34,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {41360#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {41356#(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; {41360#(< main_~b~0 main_~a~0)} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {41195#true} assume !(~c~0 >= ~b~0); {41356#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-08 05:49:34,343 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {41195#true} {41195#true} #92#return; {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L272 TraceCheckUtils]: 47: Hoare triple {41195#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)); {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {41195#true} {41195#true} #90#return; {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 45: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L272 TraceCheckUtils]: 42: Hoare triple {41195#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {41195#true} {41195#true} #88#return; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L272 TraceCheckUtils]: 37: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {41195#true} {41195#true} #86#return; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L272 TraceCheckUtils]: 32: Hoare triple {41195#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 31: Hoare triple {41195#true} assume !!(#t~post7 < 10);havoc #t~post7; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {41195#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {41195#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {41195#true} is VALID [2022-04-08 05:49:34,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {41195#true} assume !!(#t~post6 < 10);havoc #t~post6; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {41195#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {41195#true} {41195#true} #84#return; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L272 TraceCheckUtils]: 22: Hoare triple {41195#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {41195#true} {41195#true} #82#return; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {41195#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {41195#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; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41195#true} {41195#true} #80#return; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L272 TraceCheckUtils]: 11: Hoare triple {41195#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41195#true} {41195#true} #78#return; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 == ~cond); {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} ~cond := #in~cond; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {41195#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret8 := main(); {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #98#return; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {41195#true} is VALID [2022-04-08 05:49:34,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41195#true} is VALID [2022-04-08 05:49:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 05:49:34,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:34,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582628676] [2022-04-08 05:49:34,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:34,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773205623] [2022-04-08 05:49:34,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773205623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:34,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:34,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-04-08 05:49:34,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:34,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417313689] [2022-04-08 05:49:34,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417313689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:34,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:34,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 05:49:34,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729909794] [2022-04-08 05:49:34,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:34,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 111 [2022-04-08 05:49:34,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:34,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-08 05:49:34,413 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-08 05:49:34,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 05:49:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:34,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 05:49:34,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 05:49:34,413 INFO L87 Difference]: Start difference. First operand 423 states and 536 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-08 05:49:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:36,150 INFO L93 Difference]: Finished difference Result 589 states and 810 transitions. [2022-04-08 05:49:36,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 05:49:36,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 111 [2022-04-08 05:49:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-08 05:49:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-08 05:49:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-08 05:49:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 178 transitions. [2022-04-08 05:49:36,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 178 transitions. [2022-04-08 05:49:36,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:36,330 INFO L225 Difference]: With dead ends: 589 [2022-04-08 05:49:36,330 INFO L226 Difference]: Without dead ends: 581 [2022-04-08 05:49:36,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-04-08 05:49:36,331 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 32 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:36,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 368 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 05:49:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-08 05:49:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 470. [2022-04-08 05:49:37,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:37,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 581 states. Second operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:37,406 INFO L74 IsIncluded]: Start isIncluded. First operand 581 states. Second operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:37,407 INFO L87 Difference]: Start difference. First operand 581 states. Second operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:37,421 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-08 05:49:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-08 05:49:37,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:37,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:37,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 581 states. [2022-04-08 05:49:37,423 INFO L87 Difference]: Start difference. First operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 581 states. [2022-04-08 05:49:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:37,438 INFO L93 Difference]: Finished difference Result 581 states and 798 transitions. [2022-04-08 05:49:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 798 transitions. [2022-04-08 05:49:37,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:37,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:37,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:37,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:37,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 306 states have internal predecessors, (369), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 614 transitions. [2022-04-08 05:49:37,451 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 614 transitions. Word has length 111 [2022-04-08 05:49:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:37,451 INFO L478 AbstractCegarLoop]: Abstraction has 470 states and 614 transitions. [2022-04-08 05:49:37,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-04-08 05:49:37,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 470 states and 614 transitions. [2022-04-08 05:49:38,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 614 transitions. [2022-04-08 05:49:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-08 05:49:38,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:38,398 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 05:49:38,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-08 05:49:38,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 05:49:38,599 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:38,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 3 times [2022-04-08 05:49:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:38,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801844261] [2022-04-08 05:49:38,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1282766646, now seen corresponding path program 4 times [2022-04-08 05:49:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403517811] [2022-04-08 05:49:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:38,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:38,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893226357] [2022-04-08 05:49:38,623 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:49:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:38,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:38,624 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:38,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 05:49:38,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:49:38,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:38,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 05:49:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:38,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:38,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {45173#true} call ULTIMATE.init(); {45173#true} is VALID [2022-04-08 05:49:38,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {45173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45181#(<= ~counter~0 0)} {45173#true} #98#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {45181#(<= ~counter~0 0)} call #t~ret8 := main(); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {45181#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #78#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,985 INFO L272 TraceCheckUtils]: 11: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #80#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {45181#(<= ~counter~0 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; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,993 INFO L272 TraceCheckUtils]: 17: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,994 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #82#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,995 INFO L272 TraceCheckUtils]: 22: Hoare triple {45181#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {45181#(<= ~counter~0 0)} ~cond := #in~cond; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {45181#(<= ~counter~0 0)} assume !(0 == ~cond); {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {45181#(<= ~counter~0 0)} assume true; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,996 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45181#(<= ~counter~0 0)} {45181#(<= ~counter~0 0)} #84#return; {45181#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:38,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {45181#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45260#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:38,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {45260#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {45260#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:38,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {45260#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45260#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:38,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {45260#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:38,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {45270#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:38,999 INFO L272 TraceCheckUtils]: 32: Hoare triple {45270#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,001 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #86#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,001 INFO L272 TraceCheckUtils]: 37: Hoare triple {45270#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,002 INFO L290 TraceCheckUtils]: 39: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,002 INFO L290 TraceCheckUtils]: 40: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,003 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #88#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,004 INFO L272 TraceCheckUtils]: 42: Hoare triple {45270#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,004 INFO L290 TraceCheckUtils]: 44: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,004 INFO L290 TraceCheckUtils]: 45: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,005 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #90#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,006 INFO L272 TraceCheckUtils]: 47: Hoare triple {45270#(<= ~counter~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)); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {45270#(<= ~counter~0 2)} ~cond := #in~cond; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {45270#(<= ~counter~0 2)} assume !(0 == ~cond); {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {45270#(<= ~counter~0 2)} assume true; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,007 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45270#(<= ~counter~0 2)} {45270#(<= ~counter~0 2)} #92#return; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {45270#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45270#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:39,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {45270#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,009 INFO L290 TraceCheckUtils]: 54: Hoare triple {45340#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,009 INFO L272 TraceCheckUtils]: 55: Hoare triple {45340#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,009 INFO L290 TraceCheckUtils]: 56: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,011 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #86#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,011 INFO L272 TraceCheckUtils]: 60: Hoare triple {45340#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,012 INFO L290 TraceCheckUtils]: 62: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,012 INFO L290 TraceCheckUtils]: 63: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,013 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #88#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,013 INFO L272 TraceCheckUtils]: 65: Hoare triple {45340#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,014 INFO L290 TraceCheckUtils]: 66: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,014 INFO L290 TraceCheckUtils]: 67: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,014 INFO L290 TraceCheckUtils]: 68: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,015 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #90#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,015 INFO L272 TraceCheckUtils]: 70: Hoare triple {45340#(<= ~counter~0 3)} 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)); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,016 INFO L290 TraceCheckUtils]: 71: Hoare triple {45340#(<= ~counter~0 3)} ~cond := #in~cond; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,016 INFO L290 TraceCheckUtils]: 72: Hoare triple {45340#(<= ~counter~0 3)} assume !(0 == ~cond); {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {45340#(<= ~counter~0 3)} assume true; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,017 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45340#(<= ~counter~0 3)} {45340#(<= ~counter~0 3)} #92#return; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,017 INFO L290 TraceCheckUtils]: 75: Hoare triple {45340#(<= ~counter~0 3)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45340#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:39,018 INFO L290 TraceCheckUtils]: 76: Hoare triple {45340#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,018 INFO L290 TraceCheckUtils]: 77: Hoare triple {45410#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,019 INFO L272 TraceCheckUtils]: 78: Hoare triple {45410#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,019 INFO L290 TraceCheckUtils]: 79: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,019 INFO L290 TraceCheckUtils]: 80: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,019 INFO L290 TraceCheckUtils]: 81: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,020 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #86#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,020 INFO L272 TraceCheckUtils]: 83: Hoare triple {45410#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,021 INFO L290 TraceCheckUtils]: 84: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,021 INFO L290 TraceCheckUtils]: 85: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,021 INFO L290 TraceCheckUtils]: 86: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,022 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #88#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,022 INFO L272 TraceCheckUtils]: 88: Hoare triple {45410#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,022 INFO L290 TraceCheckUtils]: 89: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,023 INFO L290 TraceCheckUtils]: 90: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,023 INFO L290 TraceCheckUtils]: 91: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,024 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #90#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,024 INFO L272 TraceCheckUtils]: 93: Hoare triple {45410#(<= ~counter~0 4)} 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)); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,024 INFO L290 TraceCheckUtils]: 94: Hoare triple {45410#(<= ~counter~0 4)} ~cond := #in~cond; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,025 INFO L290 TraceCheckUtils]: 95: Hoare triple {45410#(<= ~counter~0 4)} assume !(0 == ~cond); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,025 INFO L290 TraceCheckUtils]: 96: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,026 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45410#(<= ~counter~0 4)} {45410#(<= ~counter~0 4)} #92#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,026 INFO L290 TraceCheckUtils]: 98: Hoare triple {45410#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,026 INFO L290 TraceCheckUtils]: 99: Hoare triple {45410#(<= ~counter~0 4)} ~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; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,027 INFO L290 TraceCheckUtils]: 100: Hoare triple {45410#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:39,027 INFO L290 TraceCheckUtils]: 101: Hoare triple {45483#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:39,027 INFO L290 TraceCheckUtils]: 102: Hoare triple {45483#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45483#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 103: Hoare triple {45483#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45493#(<= |main_#t~post7| 5)} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 104: Hoare triple {45493#(<= |main_#t~post7| 5)} assume !(#t~post7 < 10);havoc #t~post7; {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 105: Hoare triple {45174#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; {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 106: Hoare triple {45174#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 107: Hoare triple {45174#false} assume !(#t~post6 < 10);havoc #t~post6; {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L272 TraceCheckUtils]: 108: Hoare triple {45174#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 109: Hoare triple {45174#false} ~cond := #in~cond; {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 110: Hoare triple {45174#false} assume 0 == ~cond; {45174#false} is VALID [2022-04-08 05:49:39,028 INFO L290 TraceCheckUtils]: 111: Hoare triple {45174#false} assume !false; {45174#false} is VALID [2022-04-08 05:49:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 29 proven. 222 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-08 05:49:39,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:39,441 INFO L290 TraceCheckUtils]: 111: Hoare triple {45174#false} assume !false; {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L290 TraceCheckUtils]: 110: Hoare triple {45174#false} assume 0 == ~cond; {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L290 TraceCheckUtils]: 109: Hoare triple {45174#false} ~cond := #in~cond; {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L272 TraceCheckUtils]: 108: Hoare triple {45174#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L290 TraceCheckUtils]: 107: Hoare triple {45174#false} assume !(#t~post6 < 10);havoc #t~post6; {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L290 TraceCheckUtils]: 106: Hoare triple {45174#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L290 TraceCheckUtils]: 105: Hoare triple {45174#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; {45174#false} is VALID [2022-04-08 05:49:39,442 INFO L290 TraceCheckUtils]: 104: Hoare triple {45539#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {45174#false} is VALID [2022-04-08 05:49:39,443 INFO L290 TraceCheckUtils]: 103: Hoare triple {45543#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45539#(< |main_#t~post7| 10)} is VALID [2022-04-08 05:49:39,443 INFO L290 TraceCheckUtils]: 102: Hoare triple {45543#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45543#(< ~counter~0 10)} is VALID [2022-04-08 05:49:39,443 INFO L290 TraceCheckUtils]: 101: Hoare triple {45543#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {45543#(< ~counter~0 10)} is VALID [2022-04-08 05:49:39,444 INFO L290 TraceCheckUtils]: 100: Hoare triple {45553#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45543#(< ~counter~0 10)} is VALID [2022-04-08 05:49:39,445 INFO L290 TraceCheckUtils]: 99: Hoare triple {45553#(< ~counter~0 9)} ~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; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,445 INFO L290 TraceCheckUtils]: 98: Hoare triple {45553#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,445 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #92#return; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,445 INFO L290 TraceCheckUtils]: 96: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,446 INFO L290 TraceCheckUtils]: 95: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,446 INFO L290 TraceCheckUtils]: 94: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,446 INFO L272 TraceCheckUtils]: 93: Hoare triple {45553#(< ~counter~0 9)} 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)); {45173#true} is VALID [2022-04-08 05:49:39,450 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #90#return; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,450 INFO L290 TraceCheckUtils]: 91: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,451 INFO L272 TraceCheckUtils]: 88: Hoare triple {45553#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,452 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #88#return; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,452 INFO L272 TraceCheckUtils]: 83: Hoare triple {45553#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,453 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {45173#true} {45553#(< ~counter~0 9)} #86#return; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,453 INFO L290 TraceCheckUtils]: 81: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,453 INFO L290 TraceCheckUtils]: 80: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,453 INFO L290 TraceCheckUtils]: 79: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,453 INFO L272 TraceCheckUtils]: 78: Hoare triple {45553#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,453 INFO L290 TraceCheckUtils]: 77: Hoare triple {45553#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {45626#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45553#(< ~counter~0 9)} is VALID [2022-04-08 05:49:39,454 INFO L290 TraceCheckUtils]: 75: Hoare triple {45626#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,455 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #92#return; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,455 INFO L290 TraceCheckUtils]: 72: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,455 INFO L290 TraceCheckUtils]: 71: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,455 INFO L272 TraceCheckUtils]: 70: Hoare triple {45626#(< ~counter~0 8)} 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)); {45173#true} is VALID [2022-04-08 05:49:39,456 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #90#return; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,456 INFO L290 TraceCheckUtils]: 67: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,456 INFO L272 TraceCheckUtils]: 65: Hoare triple {45626#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,456 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #88#return; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L290 TraceCheckUtils]: 62: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L290 TraceCheckUtils]: 61: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L272 TraceCheckUtils]: 60: Hoare triple {45626#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {45173#true} {45626#(< ~counter~0 8)} #86#return; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,457 INFO L290 TraceCheckUtils]: 58: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,457 INFO L272 TraceCheckUtils]: 55: Hoare triple {45626#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {45626#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,458 INFO L290 TraceCheckUtils]: 53: Hoare triple {45696#(< ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45626#(< ~counter~0 8)} is VALID [2022-04-08 05:49:39,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {45696#(< ~counter~0 7)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,459 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #92#return; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,460 INFO L272 TraceCheckUtils]: 47: Hoare triple {45696#(< ~counter~0 7)} 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)); {45173#true} is VALID [2022-04-08 05:49:39,460 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #90#return; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,460 INFO L272 TraceCheckUtils]: 42: Hoare triple {45696#(< ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,461 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #88#return; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,461 INFO L290 TraceCheckUtils]: 40: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,461 INFO L272 TraceCheckUtils]: 37: Hoare triple {45696#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,462 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {45173#true} {45696#(< ~counter~0 7)} #86#return; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,462 INFO L272 TraceCheckUtils]: 32: Hoare triple {45696#(< ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,462 INFO L290 TraceCheckUtils]: 31: Hoare triple {45696#(< ~counter~0 7)} assume !!(#t~post7 < 10);havoc #t~post7; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {45483#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {45696#(< ~counter~0 7)} is VALID [2022-04-08 05:49:39,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {45483#(<= ~counter~0 5)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {45483#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:39,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {45483#(<= ~counter~0 5)} assume !!(#t~post6 < 10);havoc #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:39,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {45410#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {45483#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:39,464 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #84#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L272 TraceCheckUtils]: 22: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #82#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L272 TraceCheckUtils]: 17: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {45410#(<= ~counter~0 4)} ~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; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,466 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #80#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,466 INFO L272 TraceCheckUtils]: 11: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {45173#true} {45410#(<= ~counter~0 4)} #78#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {45173#true} assume true; {45173#true} is VALID [2022-04-08 05:49:39,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {45173#true} assume !(0 == ~cond); {45173#true} is VALID [2022-04-08 05:49:39,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {45173#true} ~cond := #in~cond; {45173#true} is VALID [2022-04-08 05:49:39,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {45410#(<= ~counter~0 4)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {45173#true} is VALID [2022-04-08 05:49:39,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {45410#(<= ~counter~0 4)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {45410#(<= ~counter~0 4)} call #t~ret8 := main(); {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45410#(<= ~counter~0 4)} {45173#true} #98#return; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {45410#(<= ~counter~0 4)} assume true; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {45173#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {45410#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:39,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {45173#true} call ULTIMATE.init(); {45173#true} is VALID [2022-04-08 05:49:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 05:49:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403517811] [2022-04-08 05:49:39,469 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893226357] [2022-04-08 05:49:39,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893226357] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:39,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:39,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-08 05:49:39,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801844261] [2022-04-08 05:49:39,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801844261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:39,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:39,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 05:49:39,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569401221] [2022-04-08 05:49:39,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:39,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 112 [2022-04-08 05:49:39,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:39,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:39,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:39,546 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 05:49:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 05:49:39,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:49:39,546 INFO L87 Difference]: Start difference. First operand 470 states and 614 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:40,858 INFO L93 Difference]: Finished difference Result 644 states and 881 transitions. [2022-04-08 05:49:40,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:49:40,858 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 112 [2022-04-08 05:49:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-08 05:49:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2022-04-08 05:49:40,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 152 transitions. [2022-04-08 05:49:40,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:40,996 INFO L225 Difference]: With dead ends: 644 [2022-04-08 05:49:40,996 INFO L226 Difference]: Without dead ends: 474 [2022-04-08 05:49:40,997 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=187, Unknown=0, NotChecked=0, Total=306 [2022-04-08 05:49:40,997 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 54 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:40,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 204 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:49:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-08 05:49:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-04-08 05:49:41,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:41,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 474 states. Second operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:41,944 INFO L74 IsIncluded]: Start isIncluded. First operand 474 states. Second operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:41,945 INFO L87 Difference]: Start difference. First operand 474 states. Second operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:41,954 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-08 05:49:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-08 05:49:41,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:41,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:41,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 474 states. [2022-04-08 05:49:41,956 INFO L87 Difference]: Start difference. First operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) Second operand 474 states. [2022-04-08 05:49:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:41,965 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-04-08 05:49:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-08 05:49:41,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:41,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:41,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:41,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 310 states have internal predecessors, (371), 124 states have call successors, (124), 45 states have call predecessors, (124), 44 states have return successors, (121), 118 states have call predecessors, (121), 121 states have call successors, (121) [2022-04-08 05:49:41,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 616 transitions. [2022-04-08 05:49:41,977 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 616 transitions. Word has length 112 [2022-04-08 05:49:41,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:41,977 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 616 transitions. [2022-04-08 05:49:41,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:41,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 474 states and 616 transitions. [2022-04-08 05:49:42,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 616 transitions. [2022-04-08 05:49:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-08 05:49:42,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:42,921 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:49:42,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:43,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 05:49:43,136 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 5 times [2022-04-08 05:49:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:43,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504905392] [2022-04-08 05:49:43,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:43,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1546024104, now seen corresponding path program 6 times [2022-04-08 05:49:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:43,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31399211] [2022-04-08 05:49:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:43,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:43,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:43,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858301008] [2022-04-08 05:49:43,146 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:49:43,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:43,146 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:43,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 05:49:43,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 05:49:43,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:43,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 05:49:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:43,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:43,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {49050#true} call ULTIMATE.init(); {49050#true} is VALID [2022-04-08 05:49:43,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {49050#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49058#(<= ~counter~0 0)} {49050#true} #98#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {49058#(<= ~counter~0 0)} call #t~ret8 := main(); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {49058#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,536 INFO L272 TraceCheckUtils]: 6: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #78#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,537 INFO L272 TraceCheckUtils]: 11: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,537 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #80#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {49058#(<= ~counter~0 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; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,538 INFO L272 TraceCheckUtils]: 17: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,539 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #82#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,539 INFO L272 TraceCheckUtils]: 22: Hoare triple {49058#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {49058#(<= ~counter~0 0)} ~cond := #in~cond; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {49058#(<= ~counter~0 0)} assume !(0 == ~cond); {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {49058#(<= ~counter~0 0)} assume true; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,540 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49058#(<= ~counter~0 0)} {49058#(<= ~counter~0 0)} #84#return; {49058#(<= ~counter~0 0)} is VALID [2022-04-08 05:49:43,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {49058#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49137#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:43,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {49137#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {49137#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:43,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {49137#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49137#(<= ~counter~0 1)} is VALID [2022-04-08 05:49:43,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {49137#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {49147#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,542 INFO L272 TraceCheckUtils]: 32: Hoare triple {49147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,543 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #86#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,543 INFO L272 TraceCheckUtils]: 37: Hoare triple {49147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,543 INFO L290 TraceCheckUtils]: 38: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,544 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #88#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,544 INFO L272 TraceCheckUtils]: 42: Hoare triple {49147#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,545 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #90#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,546 INFO L272 TraceCheckUtils]: 47: Hoare triple {49147#(<= ~counter~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)); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {49147#(<= ~counter~0 2)} ~cond := #in~cond; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {49147#(<= ~counter~0 2)} assume !(0 == ~cond); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,546 INFO L290 TraceCheckUtils]: 50: Hoare triple {49147#(<= ~counter~0 2)} assume true; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,546 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49147#(<= ~counter~0 2)} {49147#(<= ~counter~0 2)} #92#return; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {49147#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {49147#(<= ~counter~0 2)} ~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; {49147#(<= ~counter~0 2)} is VALID [2022-04-08 05:49:43,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {49147#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {49220#(<= ~counter~0 3)} assume !!(#t~post6 < 10);havoc #t~post6; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {49220#(<= ~counter~0 3)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {49220#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {49230#(<= ~counter~0 4)} assume !!(#t~post7 < 10);havoc #t~post7; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,549 INFO L272 TraceCheckUtils]: 59: Hoare triple {49230#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,550 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #86#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,550 INFO L272 TraceCheckUtils]: 64: Hoare triple {49230#(<= ~counter~0 4)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,551 INFO L290 TraceCheckUtils]: 67: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,551 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #88#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,551 INFO L272 TraceCheckUtils]: 69: Hoare triple {49230#(<= ~counter~0 4)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,551 INFO L290 TraceCheckUtils]: 70: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,552 INFO L290 TraceCheckUtils]: 72: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,552 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #90#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,552 INFO L272 TraceCheckUtils]: 74: Hoare triple {49230#(<= ~counter~0 4)} 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)); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,553 INFO L290 TraceCheckUtils]: 75: Hoare triple {49230#(<= ~counter~0 4)} ~cond := #in~cond; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,553 INFO L290 TraceCheckUtils]: 76: Hoare triple {49230#(<= ~counter~0 4)} assume !(0 == ~cond); {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,553 INFO L290 TraceCheckUtils]: 77: Hoare triple {49230#(<= ~counter~0 4)} assume true; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,553 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49230#(<= ~counter~0 4)} {49230#(<= ~counter~0 4)} #92#return; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,554 INFO L290 TraceCheckUtils]: 79: Hoare triple {49230#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,554 INFO L290 TraceCheckUtils]: 80: Hoare triple {49230#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,554 INFO L290 TraceCheckUtils]: 81: Hoare triple {49300#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,555 INFO L272 TraceCheckUtils]: 82: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,555 INFO L290 TraceCheckUtils]: 83: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,555 INFO L290 TraceCheckUtils]: 84: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,555 INFO L290 TraceCheckUtils]: 85: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,555 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #86#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,556 INFO L272 TraceCheckUtils]: 87: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,556 INFO L290 TraceCheckUtils]: 88: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,556 INFO L290 TraceCheckUtils]: 89: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,556 INFO L290 TraceCheckUtils]: 90: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,557 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #88#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,557 INFO L272 TraceCheckUtils]: 92: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,557 INFO L290 TraceCheckUtils]: 93: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,557 INFO L290 TraceCheckUtils]: 94: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,557 INFO L290 TraceCheckUtils]: 95: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,558 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #90#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,558 INFO L272 TraceCheckUtils]: 97: Hoare triple {49300#(<= ~counter~0 5)} 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)); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,558 INFO L290 TraceCheckUtils]: 98: Hoare triple {49300#(<= ~counter~0 5)} ~cond := #in~cond; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,558 INFO L290 TraceCheckUtils]: 99: Hoare triple {49300#(<= ~counter~0 5)} assume !(0 == ~cond); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,559 INFO L290 TraceCheckUtils]: 100: Hoare triple {49300#(<= ~counter~0 5)} assume true; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,559 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49300#(<= ~counter~0 5)} {49300#(<= ~counter~0 5)} #92#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {49300#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {49300#(<= ~counter~0 5)} ~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; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,560 INFO L290 TraceCheckUtils]: 104: Hoare triple {49300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-08 05:49:43,560 INFO L290 TraceCheckUtils]: 105: Hoare triple {49373#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-08 05:49:43,560 INFO L290 TraceCheckUtils]: 106: Hoare triple {49373#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49373#(<= ~counter~0 6)} is VALID [2022-04-08 05:49:43,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {49373#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49383#(<= |main_#t~post7| 6)} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 108: Hoare triple {49383#(<= |main_#t~post7| 6)} assume !(#t~post7 < 10);havoc #t~post7; {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 109: Hoare triple {49051#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; {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 110: Hoare triple {49051#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 111: Hoare triple {49051#false} assume !(#t~post6 < 10);havoc #t~post6; {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L272 TraceCheckUtils]: 112: Hoare triple {49051#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 113: Hoare triple {49051#false} ~cond := #in~cond; {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 114: Hoare triple {49051#false} assume 0 == ~cond; {49051#false} is VALID [2022-04-08 05:49:43,561 INFO L290 TraceCheckUtils]: 115: Hoare triple {49051#false} assume !false; {49051#false} is VALID [2022-04-08 05:49:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 229 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-04-08 05:49:43,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:43,825 INFO L290 TraceCheckUtils]: 115: Hoare triple {49051#false} assume !false; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 114: Hoare triple {49051#false} assume 0 == ~cond; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 113: Hoare triple {49051#false} ~cond := #in~cond; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L272 TraceCheckUtils]: 112: Hoare triple {49051#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 111: Hoare triple {49051#false} assume !(#t~post6 < 10);havoc #t~post6; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 110: Hoare triple {49051#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 109: Hoare triple {49051#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; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 108: Hoare triple {49429#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {49051#false} is VALID [2022-04-08 05:49:43,826 INFO L290 TraceCheckUtils]: 107: Hoare triple {49433#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49429#(< |main_#t~post7| 10)} is VALID [2022-04-08 05:49:43,827 INFO L290 TraceCheckUtils]: 106: Hoare triple {49433#(< ~counter~0 10)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49433#(< ~counter~0 10)} is VALID [2022-04-08 05:49:43,827 INFO L290 TraceCheckUtils]: 105: Hoare triple {49433#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {49433#(< ~counter~0 10)} is VALID [2022-04-08 05:49:43,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {49443#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49433#(< ~counter~0 10)} is VALID [2022-04-08 05:49:43,828 INFO L290 TraceCheckUtils]: 103: Hoare triple {49443#(< ~counter~0 9)} ~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; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,828 INFO L290 TraceCheckUtils]: 102: Hoare triple {49443#(< ~counter~0 9)} assume !(~c~0 >= ~b~0); {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,829 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #92#return; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,829 INFO L290 TraceCheckUtils]: 100: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,829 INFO L290 TraceCheckUtils]: 99: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,829 INFO L290 TraceCheckUtils]: 98: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,829 INFO L272 TraceCheckUtils]: 97: Hoare triple {49443#(< ~counter~0 9)} 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)); {49050#true} is VALID [2022-04-08 05:49:43,829 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #90#return; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,829 INFO L290 TraceCheckUtils]: 95: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,829 INFO L290 TraceCheckUtils]: 94: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,829 INFO L290 TraceCheckUtils]: 93: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,830 INFO L272 TraceCheckUtils]: 92: Hoare triple {49443#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,830 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #88#return; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,830 INFO L290 TraceCheckUtils]: 90: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,830 INFO L290 TraceCheckUtils]: 89: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,830 INFO L290 TraceCheckUtils]: 88: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,830 INFO L272 TraceCheckUtils]: 87: Hoare triple {49443#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,835 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49050#true} {49443#(< ~counter~0 9)} #86#return; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,836 INFO L290 TraceCheckUtils]: 85: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,836 INFO L290 TraceCheckUtils]: 84: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,836 INFO L290 TraceCheckUtils]: 83: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,836 INFO L272 TraceCheckUtils]: 82: Hoare triple {49443#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {49443#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,837 INFO L290 TraceCheckUtils]: 80: Hoare triple {49516#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49443#(< ~counter~0 9)} is VALID [2022-04-08 05:49:43,838 INFO L290 TraceCheckUtils]: 79: Hoare triple {49516#(< ~counter~0 8)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,838 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #92#return; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,838 INFO L290 TraceCheckUtils]: 77: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,838 INFO L290 TraceCheckUtils]: 76: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,838 INFO L290 TraceCheckUtils]: 75: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,838 INFO L272 TraceCheckUtils]: 74: Hoare triple {49516#(< ~counter~0 8)} 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)); {49050#true} is VALID [2022-04-08 05:49:43,839 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #90#return; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,839 INFO L272 TraceCheckUtils]: 69: Hoare triple {49516#(< ~counter~0 8)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,840 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #88#return; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,840 INFO L272 TraceCheckUtils]: 64: Hoare triple {49516#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,841 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {49050#true} {49516#(< ~counter~0 8)} #86#return; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,841 INFO L272 TraceCheckUtils]: 59: Hoare triple {49516#(< ~counter~0 8)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {49516#(< ~counter~0 8)} assume !!(#t~post7 < 10);havoc #t~post7; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {49373#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49516#(< ~counter~0 8)} is VALID [2022-04-08 05:49:43,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {49373#(<= ~counter~0 6)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49373#(<= ~counter~0 6)} is VALID [2022-04-08 05:49:43,843 INFO L290 TraceCheckUtils]: 55: Hoare triple {49373#(<= ~counter~0 6)} assume !!(#t~post6 < 10);havoc #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-08 05:49:43,843 INFO L290 TraceCheckUtils]: 54: Hoare triple {49300#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49373#(<= ~counter~0 6)} is VALID [2022-04-08 05:49:43,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {49300#(<= ~counter~0 5)} ~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; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {49300#(<= ~counter~0 5)} assume !(~c~0 >= ~b~0); {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,845 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #92#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,845 INFO L272 TraceCheckUtils]: 47: Hoare triple {49300#(<= ~counter~0 5)} 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)); {49050#true} is VALID [2022-04-08 05:49:43,846 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #90#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,846 INFO L272 TraceCheckUtils]: 42: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,847 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #88#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,847 INFO L272 TraceCheckUtils]: 37: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,847 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {49050#true} {49300#(<= ~counter~0 5)} #86#return; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,847 INFO L290 TraceCheckUtils]: 35: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,848 INFO L290 TraceCheckUtils]: 34: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,848 INFO L272 TraceCheckUtils]: 32: Hoare triple {49300#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {49300#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {49230#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {49300#(<= ~counter~0 5)} is VALID [2022-04-08 05:49:43,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {49230#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {49230#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {49220#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49230#(<= ~counter~0 4)} is VALID [2022-04-08 05:49:43,850 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #84#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L272 TraceCheckUtils]: 22: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #82#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,851 INFO L272 TraceCheckUtils]: 17: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {49220#(<= ~counter~0 3)} ~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; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #80#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49050#true} {49220#(<= ~counter~0 3)} #78#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {49050#true} assume true; {49050#true} is VALID [2022-04-08 05:49:43,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {49050#true} assume !(0 == ~cond); {49050#true} is VALID [2022-04-08 05:49:43,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {49050#true} ~cond := #in~cond; {49050#true} is VALID [2022-04-08 05:49:43,853 INFO L272 TraceCheckUtils]: 6: Hoare triple {49220#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {49050#true} is VALID [2022-04-08 05:49:43,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {49220#(<= ~counter~0 3)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {49220#(<= ~counter~0 3)} call #t~ret8 := main(); {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49220#(<= ~counter~0 3)} {49050#true} #98#return; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {49220#(<= ~counter~0 3)} assume true; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {49050#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {49220#(<= ~counter~0 3)} is VALID [2022-04-08 05:49:43,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {49050#true} call ULTIMATE.init(); {49050#true} is VALID [2022-04-08 05:49:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 32 proven. 37 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2022-04-08 05:49:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31399211] [2022-04-08 05:49:43,855 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:43,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858301008] [2022-04-08 05:49:43,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858301008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:43,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 05:49:43,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:43,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504905392] [2022-04-08 05:49:43,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504905392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:43,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 05:49:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975924709] [2022-04-08 05:49:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-08 05:49:43,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:43,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:43,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:43,924 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 05:49:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 05:49:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:49:43,924 INFO L87 Difference]: Start difference. First operand 474 states and 616 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:45,414 INFO L93 Difference]: Finished difference Result 731 states and 966 transitions. [2022-04-08 05:49:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 05:49:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 116 [2022-04-08 05:49:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:49:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-08 05:49:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2022-04-08 05:49:45,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 175 transitions. [2022-04-08 05:49:45,529 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-08 05:49:45,543 INFO L225 Difference]: With dead ends: 731 [2022-04-08 05:49:45,543 INFO L226 Difference]: Without dead ends: 561 [2022-04-08 05:49:45,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-08 05:49:45,545 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 77 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:49:45,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 220 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:49:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2022-04-08 05:49:46,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 553. [2022-04-08 05:49:46,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:49:46,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 561 states. Second operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:49:46,431 INFO L74 IsIncluded]: Start isIncluded. First operand 561 states. Second operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:49:46,432 INFO L87 Difference]: Start difference. First operand 561 states. Second operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:49:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:46,443 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-08 05:49:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-08 05:49:46,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:46,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:46,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) Second operand 561 states. [2022-04-08 05:49:46,444 INFO L87 Difference]: Start difference. First operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) Second operand 561 states. [2022-04-08 05:49:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:49:46,455 INFO L93 Difference]: Finished difference Result 561 states and 699 transitions. [2022-04-08 05:49:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 699 transitions. [2022-04-08 05:49:46,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:49:46,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:49:46,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:49:46,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:49:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 361 states have (on average 1.1911357340720221) internal successors, (430), 367 states have internal predecessors, (430), 133 states have call successors, (133), 59 states have call predecessors, (133), 58 states have return successors, (129), 126 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:49:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 692 transitions. [2022-04-08 05:49:46,471 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 692 transitions. Word has length 116 [2022-04-08 05:49:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:49:46,471 INFO L478 AbstractCegarLoop]: Abstraction has 553 states and 692 transitions. [2022-04-08 05:49:46,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 6 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2022-04-08 05:49:46,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 692 transitions. [2022-04-08 05:49:47,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:49:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 692 transitions. [2022-04-08 05:49:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 05:49:47,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:49:47,344 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-08 05:49:47,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 05:49:47,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:47,561 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:49:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:49:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 3 times [2022-04-08 05:49:47,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:47,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [213853122] [2022-04-08 05:49:47,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:49:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1978671899, now seen corresponding path program 4 times [2022-04-08 05:49:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:49:47,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117675535] [2022-04-08 05:49:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:49:47,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:49:47,572 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:49:47,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1386423642] [2022-04-08 05:49:47,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:49:47,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:49:47,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:49:47,573 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:49:47,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 05:49:47,636 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:49:47,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:49:47,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 05:49:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:49:47,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:49:47,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {53459#true} call ULTIMATE.init(); {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {53459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53459#true} {53459#true} #98#return; {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {53459#true} call #t~ret8 := main(); {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {53459#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L272 TraceCheckUtils]: 6: Hoare triple {53459#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53459#true} {53459#true} #78#return; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {53459#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53459#true} {53459#true} #80#return; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {53459#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; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L272 TraceCheckUtils]: 17: Hoare triple {53459#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,908 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53459#true} {53459#true} #82#return; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L272 TraceCheckUtils]: 22: Hoare triple {53459#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53459#true} {53459#true} #84#return; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L272 TraceCheckUtils]: 32: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,909 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L272 TraceCheckUtils]: 37: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L272 TraceCheckUtils]: 42: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L272 TraceCheckUtils]: 47: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,910 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 52: Hoare triple {53459#true} assume !(~c~0 >= ~b~0); {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {53459#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; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L272 TraceCheckUtils]: 59: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L272 TraceCheckUtils]: 64: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L272 TraceCheckUtils]: 69: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 71: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L272 TraceCheckUtils]: 74: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 77: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 79: Hoare triple {53459#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 80: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-08 05:49:47,912 INFO L290 TraceCheckUtils]: 81: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L272 TraceCheckUtils]: 82: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 85: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L272 TraceCheckUtils]: 87: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 88: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 89: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 90: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L272 TraceCheckUtils]: 92: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:47,913 INFO L290 TraceCheckUtils]: 93: Hoare triple {53459#true} ~cond := #in~cond; {53743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:47,914 INFO L290 TraceCheckUtils]: 94: Hoare triple {53743#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:47,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:47,914 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} {53459#true} #90#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:49:47,915 INFO L272 TraceCheckUtils]: 97: Hoare triple {53754#(= 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)); {53459#true} is VALID [2022-04-08 05:49:47,915 INFO L290 TraceCheckUtils]: 98: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,915 INFO L290 TraceCheckUtils]: 99: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,915 INFO L290 TraceCheckUtils]: 100: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,915 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {53459#true} {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:49:47,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:49:47,916 INFO L290 TraceCheckUtils]: 103: Hoare triple {53754#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,916 INFO L290 TraceCheckUtils]: 104: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,916 INFO L290 TraceCheckUtils]: 105: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,917 INFO L290 TraceCheckUtils]: 106: Hoare triple {53776#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,917 INFO L290 TraceCheckUtils]: 107: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,917 INFO L290 TraceCheckUtils]: 108: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,917 INFO L272 TraceCheckUtils]: 109: Hoare triple {53776#(= 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)); {53459#true} is VALID [2022-04-08 05:49:47,917 INFO L290 TraceCheckUtils]: 110: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:47,918 INFO L290 TraceCheckUtils]: 111: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:47,918 INFO L290 TraceCheckUtils]: 112: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:47,918 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {53459#true} {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:47,919 INFO L272 TraceCheckUtils]: 114: Hoare triple {53776#(= 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)); {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:47,919 INFO L290 TraceCheckUtils]: 115: Hoare triple {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:47,919 INFO L290 TraceCheckUtils]: 116: Hoare triple {53814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53460#false} is VALID [2022-04-08 05:49:47,919 INFO L290 TraceCheckUtils]: 117: Hoare triple {53460#false} assume !false; {53460#false} is VALID [2022-04-08 05:49:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-04-08 05:49:47,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:49:59,621 INFO L290 TraceCheckUtils]: 117: Hoare triple {53460#false} assume !false; {53460#false} is VALID [2022-04-08 05:49:59,621 INFO L290 TraceCheckUtils]: 116: Hoare triple {53814#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53460#false} is VALID [2022-04-08 05:49:59,622 INFO L290 TraceCheckUtils]: 115: Hoare triple {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53814#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:49:59,622 INFO L272 TraceCheckUtils]: 114: Hoare triple {53776#(= 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)); {53810#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:49:59,623 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {53459#true} {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #86#return; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,623 INFO L290 TraceCheckUtils]: 112: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,623 INFO L290 TraceCheckUtils]: 111: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,623 INFO L290 TraceCheckUtils]: 110: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,623 INFO L272 TraceCheckUtils]: 109: Hoare triple {53776#(= 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)); {53459#true} is VALID [2022-04-08 05:49:59,630 INFO L290 TraceCheckUtils]: 108: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,640 INFO L290 TraceCheckUtils]: 107: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,641 INFO L290 TraceCheckUtils]: 106: Hoare triple {53776#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,641 INFO L290 TraceCheckUtils]: 105: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,641 INFO L290 TraceCheckUtils]: 104: Hoare triple {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,642 INFO L290 TraceCheckUtils]: 103: Hoare triple {53754#(= 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; {53776#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-08 05:49:59,642 INFO L290 TraceCheckUtils]: 102: Hoare triple {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:49:59,643 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {53459#true} {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #92#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:49:59,643 INFO L290 TraceCheckUtils]: 100: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,643 INFO L290 TraceCheckUtils]: 99: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,643 INFO L290 TraceCheckUtils]: 98: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,643 INFO L272 TraceCheckUtils]: 97: Hoare triple {53754#(= 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)); {53459#true} is VALID [2022-04-08 05:49:59,644 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} {53459#true} #90#return; {53754#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:49:59,644 INFO L290 TraceCheckUtils]: 95: Hoare triple {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:59,644 INFO L290 TraceCheckUtils]: 94: Hoare triple {53893#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {53747#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 93: Hoare triple {53459#true} ~cond := #in~cond; {53893#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:49:59,645 INFO L272 TraceCheckUtils]: 92: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 90: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 89: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 88: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L272 TraceCheckUtils]: 87: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 85: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 84: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 83: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L272 TraceCheckUtils]: 82: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-08 05:49:59,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {53459#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 77: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L272 TraceCheckUtils]: 74: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 70: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L272 TraceCheckUtils]: 69: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 67: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 66: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,646 INFO L272 TraceCheckUtils]: 64: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L272 TraceCheckUtils]: 59: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {53459#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; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 52: Hoare triple {53459#true} assume !(~c~0 >= ~b~0); {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {53459#true} {53459#true} #92#return; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L272 TraceCheckUtils]: 47: Hoare triple {53459#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)); {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {53459#true} {53459#true} #90#return; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 43: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L272 TraceCheckUtils]: 42: Hoare triple {53459#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {53459#true} {53459#true} #88#return; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 40: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L272 TraceCheckUtils]: 37: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {53459#true} {53459#true} #86#return; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L272 TraceCheckUtils]: 32: Hoare triple {53459#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {53459#true} assume !!(#t~post7 < 10);havoc #t~post7; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {53459#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {53459#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {53459#true} assume !!(#t~post6 < 10);havoc #t~post6; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {53459#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {53459#true} {53459#true} #84#return; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L272 TraceCheckUtils]: 22: Hoare triple {53459#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {53459#true} {53459#true} #82#return; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L272 TraceCheckUtils]: 17: Hoare triple {53459#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {53459#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; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {53459#true} {53459#true} #80#return; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {53459#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {53459#true} {53459#true} #78#return; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {53459#true} assume !(0 == ~cond); {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {53459#true} ~cond := #in~cond; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {53459#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {53459#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {53459#true} is VALID [2022-04-08 05:49:59,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {53459#true} call #t~ret8 := main(); {53459#true} is VALID [2022-04-08 05:49:59,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53459#true} {53459#true} #98#return; {53459#true} is VALID [2022-04-08 05:49:59,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {53459#true} assume true; {53459#true} is VALID [2022-04-08 05:49:59,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {53459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {53459#true} is VALID [2022-04-08 05:49:59,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {53459#true} call ULTIMATE.init(); {53459#true} is VALID [2022-04-08 05:49:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-04-08 05:49:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:49:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117675535] [2022-04-08 05:49:59,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:49:59,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386423642] [2022-04-08 05:49:59,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386423642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:49:59,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:49:59,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-08 05:49:59,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:49:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [213853122] [2022-04-08 05:49:59,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [213853122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:49:59,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:49:59,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 05:49:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414963613] [2022-04-08 05:49:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:49:59,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2022-04-08 05:49:59,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:49:59,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:49:59,696 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-08 05:49:59,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 05:49:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:49:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 05:49:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-08 05:49:59,697 INFO L87 Difference]: Start difference. First operand 553 states and 692 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:50:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:00,887 INFO L93 Difference]: Finished difference Result 584 states and 734 transitions. [2022-04-08 05:50:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 05:50:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 118 [2022-04-08 05:50:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:50:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:50:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-08 05:50:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:50:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-08 05:50:00,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-08 05:50:00,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:50:00,952 INFO L225 Difference]: With dead ends: 584 [2022-04-08 05:50:00,952 INFO L226 Difference]: Without dead ends: 581 [2022-04-08 05:50:00,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 05:50:00,954 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:50:00,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 190 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:50:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-04-08 05:50:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 577. [2022-04-08 05:50:02,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:50:02,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 581 states. Second operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 05:50:02,023 INFO L74 IsIncluded]: Start isIncluded. First operand 581 states. Second operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 05:50:02,023 INFO L87 Difference]: Start difference. First operand 581 states. Second operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 05:50:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:02,034 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-08 05:50:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-08 05:50:02,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:50:02,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:50:02,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) Second operand 581 states. [2022-04-08 05:50:02,036 INFO L87 Difference]: Start difference. First operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) Second operand 581 states. [2022-04-08 05:50:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:50:02,047 INFO L93 Difference]: Finished difference Result 581 states and 730 transitions. [2022-04-08 05:50:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 730 transitions. [2022-04-08 05:50:02,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:50:02,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:50:02,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:50:02,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:50:02,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 380 states have (on average 1.2) internal successors, (456), 388 states have internal predecessors, (456), 137 states have call successors, (137), 60 states have call predecessors, (137), 59 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2022-04-08 05:50:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 726 transitions. [2022-04-08 05:50:02,064 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 726 transitions. Word has length 118 [2022-04-08 05:50:02,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:50:02,064 INFO L478 AbstractCegarLoop]: Abstraction has 577 states and 726 transitions. [2022-04-08 05:50:02,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-08 05:50:02,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 577 states and 726 transitions. [2022-04-08 05:50:03,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:50:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 726 transitions. [2022-04-08 05:50:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-08 05:50:03,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:50:03,242 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 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] [2022-04-08 05:50:03,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 05:50:03,443 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 05:50:03,443 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:50:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:50:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 5 times [2022-04-08 05:50:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:50:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128872732] [2022-04-08 05:50:03,444 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:50:03,444 INFO L85 PathProgramCache]: Analyzing trace with hash 992936989, now seen corresponding path program 6 times [2022-04-08 05:50:03,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:50:03,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855178617] [2022-04-08 05:50:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:50:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:50:03,453 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:50:03,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145742539] [2022-04-08 05:50:03,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 05:50:03,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:50:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:50:03,468 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:50:03,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 05:50:03,854 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 05:50:03,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:50:03,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 05:50:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:50:03,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:50:23,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {57666#true} call ULTIMATE.init(); {57666#true} is VALID [2022-04-08 05:50:23,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {57666#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {57666#true} is VALID [2022-04-08 05:50:23,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57666#true} {57666#true} #98#return; {57666#true} is VALID [2022-04-08 05:50:23,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {57666#true} call #t~ret8 := main(); {57666#true} is VALID [2022-04-08 05:50:23,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {57666#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {57666#true} is VALID [2022-04-08 05:50:23,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {57666#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {57666#true} ~cond := #in~cond; {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:50:23,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:50:23,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:50:23,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} {57666#true} #78#return; {57703#(<= 1 main_~x~0)} is VALID [2022-04-08 05:50:23,276 INFO L272 TraceCheckUtils]: 11: Hoare triple {57703#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,276 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {57666#true} {57703#(<= 1 main_~x~0)} #80#return; {57703#(<= 1 main_~x~0)} is VALID [2022-04-08 05:50:23,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {57703#(<= 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; {57722#(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_~p~0 1))} is VALID [2022-04-08 05:50:23,277 INFO L272 TraceCheckUtils]: 17: Hoare triple {57722#(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_~p~0 1))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,278 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {57666#true} {57722#(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_~p~0 1))} #82#return; {57722#(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_~p~0 1))} is VALID [2022-04-08 05:50:23,278 INFO L272 TraceCheckUtils]: 22: Hoare triple {57722#(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_~p~0 1))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {57666#true} ~cond := #in~cond; {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 05:50:23,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {57692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:50:23,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {57696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 05:50:23,280 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {57696#(not (= |assume_abort_if_not_#in~cond| 0))} {57722#(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_~p~0 1))} #84#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,282 INFO L272 TraceCheckUtils]: 32: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,282 INFO L290 TraceCheckUtils]: 33: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,282 INFO L290 TraceCheckUtils]: 35: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,283 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #86#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,283 INFO L272 TraceCheckUtils]: 37: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,283 INFO L290 TraceCheckUtils]: 39: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,283 INFO L290 TraceCheckUtils]: 40: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,284 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #88#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,284 INFO L272 TraceCheckUtils]: 42: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,284 INFO L290 TraceCheckUtils]: 43: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,284 INFO L290 TraceCheckUtils]: 44: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,285 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #90#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,285 INFO L272 TraceCheckUtils]: 47: Hoare triple {57753#(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_~yy~0 2147483647) (= 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)); {57666#true} is VALID [2022-04-08 05:50:23,285 INFO L290 TraceCheckUtils]: 48: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,285 INFO L290 TraceCheckUtils]: 49: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,285 INFO L290 TraceCheckUtils]: 50: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,286 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #92#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,286 INFO L290 TraceCheckUtils]: 52: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,287 INFO L272 TraceCheckUtils]: 55: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,287 INFO L290 TraceCheckUtils]: 56: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,288 INFO L290 TraceCheckUtils]: 57: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,288 INFO L290 TraceCheckUtils]: 58: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,288 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #86#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,288 INFO L272 TraceCheckUtils]: 60: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,289 INFO L290 TraceCheckUtils]: 61: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,289 INFO L290 TraceCheckUtils]: 62: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,289 INFO L290 TraceCheckUtils]: 63: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,289 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #88#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,289 INFO L272 TraceCheckUtils]: 65: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,290 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #90#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,290 INFO L272 TraceCheckUtils]: 70: Hoare triple {57753#(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_~yy~0 2147483647) (= 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)); {57666#true} is VALID [2022-04-08 05:50:23,290 INFO L290 TraceCheckUtils]: 71: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,290 INFO L290 TraceCheckUtils]: 72: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,291 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {57666#true} {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} #92#return; {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {57753#(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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,294 INFO L290 TraceCheckUtils]: 77: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,294 INFO L272 TraceCheckUtils]: 78: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,294 INFO L290 TraceCheckUtils]: 79: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,294 INFO L290 TraceCheckUtils]: 80: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,294 INFO L290 TraceCheckUtils]: 81: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,295 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} #86#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,295 INFO L272 TraceCheckUtils]: 83: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,295 INFO L290 TraceCheckUtils]: 85: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,295 INFO L290 TraceCheckUtils]: 86: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,296 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} #88#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,296 INFO L272 TraceCheckUtils]: 88: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,296 INFO L290 TraceCheckUtils]: 89: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,296 INFO L290 TraceCheckUtils]: 90: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,296 INFO L290 TraceCheckUtils]: 91: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,297 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} #90#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,297 INFO L272 TraceCheckUtils]: 93: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= 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)); {57666#true} is VALID [2022-04-08 05:50:23,297 INFO L290 TraceCheckUtils]: 94: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,297 INFO L290 TraceCheckUtils]: 95: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,297 INFO L290 TraceCheckUtils]: 96: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,298 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {57666#true} {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} #92#return; {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {57901#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {57971#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (<= 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_~yy~0 2147483647) (= main_~p~0 1))} is VALID [2022-04-08 05:50:23,299 INFO L290 TraceCheckUtils]: 99: Hoare triple {57971#(and (= main_~r~0 0) (<= 1 main_~x~0) (= main_~s~0 1) (not (<= main_~y~0 main_~c~0)) (<= 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_~yy~0 2147483647) (= 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; {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} assume !!(#t~post6 < 10);havoc #t~post6; {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,300 INFO L290 TraceCheckUtils]: 102: Hoare triple {57975#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,300 INFO L290 TraceCheckUtils]: 103: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} assume !!(#t~post7 < 10);havoc #t~post7; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,301 INFO L272 TraceCheckUtils]: 105: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,301 INFO L290 TraceCheckUtils]: 106: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,301 INFO L290 TraceCheckUtils]: 107: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,302 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {57666#true} {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #86#return; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,302 INFO L272 TraceCheckUtils]: 110: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,302 INFO L290 TraceCheckUtils]: 111: Hoare triple {57666#true} ~cond := #in~cond; {57666#true} is VALID [2022-04-08 05:50:23,302 INFO L290 TraceCheckUtils]: 112: Hoare triple {57666#true} assume !(0 == ~cond); {57666#true} is VALID [2022-04-08 05:50:23,302 INFO L290 TraceCheckUtils]: 113: Hoare triple {57666#true} assume true; {57666#true} is VALID [2022-04-08 05:50:23,303 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {57666#true} {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #88#return; {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,303 INFO L272 TraceCheckUtils]: 115: Hoare triple {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {57666#true} is VALID [2022-04-08 05:50:23,303 INFO L290 TraceCheckUtils]: 116: Hoare triple {57666#true} ~cond := #in~cond; {58028#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:50:23,303 INFO L290 TraceCheckUtils]: 117: Hoare triple {58028#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:23,304 INFO L290 TraceCheckUtils]: 118: Hoare triple {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:50:23,304 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {58032#(not (= |__VERIFIER_assert_#in~cond| 0))} {57985#(and (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} #90#return; {58039#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} is VALID [2022-04-08 05:50:23,309 INFO L272 TraceCheckUtils]: 120: Hoare triple {58039#(and (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (<= 1 main_~x~0) (not (<= main_~y~0 main_~b~0)) (not (= main_~b~0 0)) (= main_~yy~0 (* main_~y~0 main_~y~0)) (<= 0 main_~b~0) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)) (< main_~yy~0 2147483647))} 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)); {58043#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:50:23,309 INFO L290 TraceCheckUtils]: 121: Hoare triple {58043#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {58047#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:50:23,309 INFO L290 TraceCheckUtils]: 122: Hoare triple {58047#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {57667#false} is VALID [2022-04-08 05:50:23,309 INFO L290 TraceCheckUtils]: 123: Hoare triple {57667#false} assume !false; {57667#false} is VALID [2022-04-08 05:50:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 91 proven. 28 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-04-08 05:50:23,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:50:55,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:50:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855178617] [2022-04-08 05:50:55,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:50:55,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145742539] [2022-04-08 05:50:55,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145742539] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 05:50:55,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 05:50:55,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-08 05:50:55,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:50:55,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128872732] [2022-04-08 05:50:55,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128872732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:50:55,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:50:55,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 05:50:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910113448] [2022-04-08 05:50:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:50:55,194 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 124 [2022-04-08 05:50:55,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:50:55,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:50:55,274 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-08 05:50:55,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 05:50:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:50:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 05:50:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:50:55,275 INFO L87 Difference]: Start difference. First operand 577 states and 726 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:51:09,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:51:09,696 INFO L93 Difference]: Finished difference Result 604 states and 757 transitions. [2022-04-08 05:51:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 05:51:09,696 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 124 [2022-04-08 05:51:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:51:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:51:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-08 05:51:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:51:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2022-04-08 05:51:09,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 111 transitions. [2022-04-08 05:51:09,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:51:09,862 INFO L225 Difference]: With dead ends: 604 [2022-04-08 05:51:09,862 INFO L226 Difference]: Without dead ends: 600 [2022-04-08 05:51:09,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-04-08 05:51:09,863 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-08 05:51:09,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 315 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-08 05:51:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-04-08 05:51:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 578. [2022-04-08 05:51:11,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:51:11,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 600 states. Second operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:51:11,125 INFO L74 IsIncluded]: Start isIncluded. First operand 600 states. Second operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:51:11,125 INFO L87 Difference]: Start difference. First operand 600 states. Second operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:51:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:51:11,137 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-08 05:51:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-08 05:51:11,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:51:11,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:51:11,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) Second operand 600 states. [2022-04-08 05:51:11,139 INFO L87 Difference]: Start difference. First operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) Second operand 600 states. [2022-04-08 05:51:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:51:11,150 INFO L93 Difference]: Finished difference Result 600 states and 752 transitions. [2022-04-08 05:51:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 752 transitions. [2022-04-08 05:51:11,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:51:11,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:51:11,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:51:11,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:51:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 384 states have (on average 1.1927083333333333) internal successors, (458), 391 states have internal predecessors, (458), 133 states have call successors, (133), 62 states have call predecessors, (133), 60 states have return successors, (129), 124 states have call predecessors, (129), 129 states have call successors, (129) [2022-04-08 05:51:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 720 transitions. [2022-04-08 05:51:11,166 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 720 transitions. Word has length 124 [2022-04-08 05:51:11,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:51:11,166 INFO L478 AbstractCegarLoop]: Abstraction has 578 states and 720 transitions. [2022-04-08 05:51:11,167 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-08 05:51:11,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 578 states and 720 transitions. [2022-04-08 05:51:12,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 720 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:51:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 720 transitions. [2022-04-08 05:51:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-08 05:51:12,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:51:12,245 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-08 05:51:12,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-08 05:51:12,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:51:12,452 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:51:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:51:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 7 times [2022-04-08 05:51:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:51:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685525253] [2022-04-08 05:51:12,453 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:51:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1110867224, now seen corresponding path program 8 times [2022-04-08 05:51:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:51:12,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202114403] [2022-04-08 05:51:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:51:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:51:12,466 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:51:12,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714723156] [2022-04-08 05:51:12,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:51:12,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:51:12,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:51:12,480 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:51:12,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 05:51:12,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:51:12,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:51:12,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-08 05:51:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:51:12,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:51:24,270 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:51:28,868 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:51:33,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {61782#true} call ULTIMATE.init(); {61782#true} is VALID [2022-04-08 05:51:33,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {61782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {61782#true} is VALID [2022-04-08 05:51:33,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61782#true} {61782#true} #98#return; {61782#true} is VALID [2022-04-08 05:51:33,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {61782#true} call #t~ret8 := main(); {61782#true} is VALID [2022-04-08 05:51:33,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {61782#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {61782#true} is VALID [2022-04-08 05:51:33,165 INFO L272 TraceCheckUtils]: 6: Hoare triple {61782#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61782#true} {61782#true} #78#return; {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {61782#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61782#true} {61782#true} #80#return; {61782#true} is VALID [2022-04-08 05:51:33,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {61782#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; {61835#(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))} is VALID [2022-04-08 05:51:33,167 INFO L272 TraceCheckUtils]: 17: Hoare triple {61835#(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))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,167 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61782#true} {61835#(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))} #82#return; {61835#(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))} is VALID [2022-04-08 05:51:33,167 INFO L272 TraceCheckUtils]: 22: Hoare triple {61835#(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))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,168 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61782#true} {61835#(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))} #84#return; {61835#(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))} is VALID [2022-04-08 05:51:33,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {61835#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61835#(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))} is VALID [2022-04-08 05:51:33,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {61835#(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))} assume !!(#t~post6 < 10);havoc #t~post6; {61835#(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))} is VALID [2022-04-08 05:51:33,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {61835#(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))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61875#(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))} is VALID [2022-04-08 05:51:33,170 INFO L290 TraceCheckUtils]: 30: Hoare triple {61875#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61875#(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))} is VALID [2022-04-08 05:51:33,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {61875#(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))} assume !!(#t~post7 < 10);havoc #t~post7; {61875#(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))} is VALID [2022-04-08 05:51:33,170 INFO L272 TraceCheckUtils]: 32: Hoare triple {61875#(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))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,171 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61782#true} {61875#(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))} #86#return; {61875#(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))} is VALID [2022-04-08 05:51:33,171 INFO L272 TraceCheckUtils]: 37: Hoare triple {61875#(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))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,172 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61782#true} {61875#(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))} #88#return; {61875#(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))} is VALID [2022-04-08 05:51:33,172 INFO L272 TraceCheckUtils]: 42: Hoare triple {61875#(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))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:33,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,173 INFO L290 TraceCheckUtils]: 45: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,174 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {61875#(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))} #90#return; {61875#(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))} is VALID [2022-04-08 05:51:33,174 INFO L272 TraceCheckUtils]: 47: Hoare triple {61875#(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))} 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)); {61782#true} is VALID [2022-04-08 05:51:33,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,174 INFO L290 TraceCheckUtils]: 50: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,175 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61782#true} {61875#(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))} #92#return; {61875#(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))} is VALID [2022-04-08 05:51:33,175 INFO L290 TraceCheckUtils]: 52: Hoare triple {61875#(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))} assume !(~c~0 >= ~b~0); {61875#(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))} is VALID [2022-04-08 05:51:33,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {61875#(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))} ~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; {61950#(and (= main_~s~0 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-08 05:51:33,176 INFO L290 TraceCheckUtils]: 54: Hoare triple {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61950#(and (= main_~s~0 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-08 05:51:33,176 INFO L290 TraceCheckUtils]: 55: Hoare triple {61950#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {61950#(and (= main_~s~0 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-08 05:51:33,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {61950#(and (= main_~s~0 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; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,178 INFO L272 TraceCheckUtils]: 59: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 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)); {61782#true} is VALID [2022-04-08 05:51:33,178 INFO L290 TraceCheckUtils]: 60: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,178 INFO L290 TraceCheckUtils]: 61: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,178 INFO L290 TraceCheckUtils]: 62: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,178 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,179 INFO L272 TraceCheckUtils]: 64: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 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)); {61782#true} is VALID [2022-04-08 05:51:33,179 INFO L290 TraceCheckUtils]: 65: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,179 INFO L290 TraceCheckUtils]: 66: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,179 INFO L290 TraceCheckUtils]: 67: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,179 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,179 INFO L272 TraceCheckUtils]: 69: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 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)); {61782#true} is VALID [2022-04-08 05:51:33,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,180 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,180 INFO L272 TraceCheckUtils]: 74: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 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)); {61782#true} is VALID [2022-04-08 05:51:33,180 INFO L290 TraceCheckUtils]: 75: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,181 INFO L290 TraceCheckUtils]: 77: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,181 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61782#true} {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #92#return; {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:51:33,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {61960#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 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; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-08 05:51:33,183 INFO L290 TraceCheckUtils]: 80: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-08 05:51:33,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-08 05:51:33,183 INFO L272 TraceCheckUtils]: 82: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,183 INFO L290 TraceCheckUtils]: 83: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:33,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,185 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} #86#return; {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} is VALID [2022-04-08 05:51:33,185 INFO L272 TraceCheckUtils]: 87: Hoare triple {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:33,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,186 INFO L290 TraceCheckUtils]: 90: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,187 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62030#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~k~0 1))} #88#return; {62067#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:51:33,187 INFO L272 TraceCheckUtils]: 92: Hoare triple {62067#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,187 INFO L290 TraceCheckUtils]: 93: Hoare triple {61782#true} ~cond := #in~cond; {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:33,187 INFO L290 TraceCheckUtils]: 94: Hoare triple {61918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,188 INFO L290 TraceCheckUtils]: 95: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:51:33,190 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62067#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~y~0 (+ main_~c~0 main_~b~0)))} #90#return; {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:51:33,190 INFO L272 TraceCheckUtils]: 97: Hoare triple {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~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)); {61782#true} is VALID [2022-04-08 05:51:33,190 INFO L290 TraceCheckUtils]: 98: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,190 INFO L290 TraceCheckUtils]: 99: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,190 INFO L290 TraceCheckUtils]: 100: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,191 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {61782#true} {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} #92#return; {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:51:33,191 INFO L290 TraceCheckUtils]: 102: Hoare triple {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~0 (* main_~y~0 main_~s~0))))} is VALID [2022-04-08 05:51:33,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {62083#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~k~0 1) (= main_~y~0 (+ (* main_~q~0 main_~x~0) main_~c~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; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,196 INFO L290 TraceCheckUtils]: 104: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,210 INFO L290 TraceCheckUtils]: 106: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,210 INFO L290 TraceCheckUtils]: 107: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,211 INFO L290 TraceCheckUtils]: 108: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} assume !!(#t~post7 < 10);havoc #t~post7; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,211 INFO L272 TraceCheckUtils]: 109: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,211 INFO L290 TraceCheckUtils]: 110: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,211 INFO L290 TraceCheckUtils]: 111: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,211 INFO L290 TraceCheckUtils]: 112: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,212 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {61782#true} {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #86#return; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,212 INFO L272 TraceCheckUtils]: 114: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:51:33,212 INFO L290 TraceCheckUtils]: 115: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:51:33,212 INFO L290 TraceCheckUtils]: 116: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:51:33,212 INFO L290 TraceCheckUtils]: 117: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:51:33,213 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {61782#true} {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} #88#return; {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} is VALID [2022-04-08 05:51:33,218 INFO L272 TraceCheckUtils]: 119: Hoare triple {62105#(and (or (and (= main_~y~0 (+ main_~b~0 (* (div main_~x~0 main_~x~0) main_~x~0))) (= (+ (div main_~x~0 main_~x~0) main_~q~0) 0)) (and (= main_~x~0 0) (= main_~b~0 main_~y~0))) (= main_~s~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:51:33,219 INFO L290 TraceCheckUtils]: 120: Hoare triple {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {62158#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:51:33,219 INFO L290 TraceCheckUtils]: 121: Hoare triple {62158#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61783#false} is VALID [2022-04-08 05:51:33,219 INFO L290 TraceCheckUtils]: 122: Hoare triple {61783#false} assume !false; {61783#false} is VALID [2022-04-08 05:51:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-08 05:51:33,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:52:30,486 INFO L290 TraceCheckUtils]: 122: Hoare triple {61783#false} assume !false; {61783#false} is VALID [2022-04-08 05:52:30,486 INFO L290 TraceCheckUtils]: 121: Hoare triple {62158#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {61783#false} is VALID [2022-04-08 05:52:30,486 INFO L290 TraceCheckUtils]: 120: Hoare triple {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {62158#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:52:30,487 INFO L272 TraceCheckUtils]: 119: Hoare triple {62174#(= 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)); {62154#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:52:30,488 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {61782#true} {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #88#return; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:30,488 INFO L290 TraceCheckUtils]: 117: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:30,488 INFO L290 TraceCheckUtils]: 116: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:30,488 INFO L290 TraceCheckUtils]: 115: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:30,488 INFO L272 TraceCheckUtils]: 114: Hoare triple {62174#(= 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)); {61782#true} is VALID [2022-04-08 05:52:30,489 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {61782#true} {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #86#return; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:30,489 INFO L290 TraceCheckUtils]: 112: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:30,489 INFO L290 TraceCheckUtils]: 111: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:30,489 INFO L290 TraceCheckUtils]: 110: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:30,489 INFO L272 TraceCheckUtils]: 109: Hoare triple {62174#(= 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)); {61782#true} is VALID [2022-04-08 05:52:30,489 INFO L290 TraceCheckUtils]: 108: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:30,490 INFO L290 TraceCheckUtils]: 107: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:30,490 INFO L290 TraceCheckUtils]: 106: Hoare triple {62174#(= 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; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:30,490 INFO L290 TraceCheckUtils]: 105: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:30,491 INFO L290 TraceCheckUtils]: 104: Hoare triple {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-08 05:52:32,493 WARN L290 TraceCheckUtils]: 103: Hoare triple {62223#(= (+ (* (+ (* (* 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; {62174#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-08 05:52:32,493 INFO L290 TraceCheckUtils]: 102: Hoare triple {62223#(= (+ (* (+ (* (* 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); {62223#(= (+ (* (+ (* (* 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-08 05:52:32,494 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {61782#true} {62223#(= (+ (* (+ (* (* 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)} #92#return; {62223#(= (+ (* (+ (* (* 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-08 05:52:32,494 INFO L290 TraceCheckUtils]: 100: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,494 INFO L290 TraceCheckUtils]: 99: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,494 INFO L290 TraceCheckUtils]: 98: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,494 INFO L272 TraceCheckUtils]: 97: Hoare triple {62223#(= (+ (* (+ (* (* 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)); {61782#true} is VALID [2022-04-08 05:52:32,495 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62245#(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)))))} #90#return; {62223#(= (+ (* (+ (* (* 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-08 05:52:32,496 INFO L290 TraceCheckUtils]: 95: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:32,496 INFO L290 TraceCheckUtils]: 94: Hoare triple {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:32,496 INFO L290 TraceCheckUtils]: 93: Hoare triple {61782#true} ~cond := #in~cond; {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:52:32,496 INFO L272 TraceCheckUtils]: 92: Hoare triple {62245#(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)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,497 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {62262#(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_~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)))))} #88#return; {62245#(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)))))} is VALID [2022-04-08 05:52:32,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:32,498 INFO L290 TraceCheckUtils]: 89: Hoare triple {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:32,498 INFO L290 TraceCheckUtils]: 88: Hoare triple {61782#true} ~cond := #in~cond; {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:52:32,498 INFO L272 TraceCheckUtils]: 87: Hoare triple {62262#(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_~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)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,546 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} {61782#true} #86#return; {62262#(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_~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)))))} is VALID [2022-04-08 05:52:32,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:32,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {61922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 83: Hoare triple {61782#true} ~cond := #in~cond; {62255#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:52:32,547 INFO L272 TraceCheckUtils]: 82: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 80: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 79: Hoare triple {61782#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {61782#true} {61782#true} #92#return; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 77: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 76: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L272 TraceCheckUtils]: 74: Hoare triple {61782#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)); {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {61782#true} {61782#true} #90#return; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L272 TraceCheckUtils]: 69: Hoare triple {61782#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {61782#true} {61782#true} #88#return; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 67: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 66: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 65: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L272 TraceCheckUtils]: 64: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61782#true} {61782#true} #86#return; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 62: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 61: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 60: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L272 TraceCheckUtils]: 59: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 58: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 57: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {61782#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61782#true} is VALID [2022-04-08 05:52:32,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {61782#true} assume !!(#t~post6 < 10);havoc #t~post6; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {61782#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 53: Hoare triple {61782#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; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {61782#true} assume !(~c~0 >= ~b~0); {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {61782#true} {61782#true} #92#return; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 50: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 49: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 48: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L272 TraceCheckUtils]: 47: Hoare triple {61782#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)); {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {61782#true} {61782#true} #90#return; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 45: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 44: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 43: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L272 TraceCheckUtils]: 42: Hoare triple {61782#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {61782#true} {61782#true} #88#return; {61782#true} is VALID [2022-04-08 05:52:32,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L272 TraceCheckUtils]: 37: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {61782#true} {61782#true} #86#return; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L272 TraceCheckUtils]: 32: Hoare triple {61782#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {61782#true} assume !!(#t~post7 < 10);havoc #t~post7; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {61782#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {61782#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {61782#true} assume !!(#t~post6 < 10);havoc #t~post6; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {61782#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {61782#true} {61782#true} #84#return; {61782#true} is VALID [2022-04-08 05:52:32,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L272 TraceCheckUtils]: 22: Hoare triple {61782#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {61782#true} {61782#true} #82#return; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L272 TraceCheckUtils]: 17: Hoare triple {61782#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {61782#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; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61782#true} {61782#true} #80#return; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L272 TraceCheckUtils]: 11: Hoare triple {61782#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61782#true} {61782#true} #78#return; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {61782#true} assume !(0 == ~cond); {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {61782#true} ~cond := #in~cond; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {61782#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {61782#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {61782#true} call #t~ret8 := main(); {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61782#true} {61782#true} #98#return; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {61782#true} assume true; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {61782#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {61782#true} call ULTIMATE.init(); {61782#true} is VALID [2022-04-08 05:52:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 125 proven. 32 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2022-04-08 05:52:32,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:52:32,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202114403] [2022-04-08 05:52:32,553 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:52:32,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714723156] [2022-04-08 05:52:32,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714723156] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:52:32,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:52:32,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2022-04-08 05:52:32,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:52:32,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685525253] [2022-04-08 05:52:32,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685525253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:52:32,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:52:32,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 05:52:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452141548] [2022-04-08 05:52:32,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:52:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 123 [2022-04-08 05:52:32,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:52:32,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-08 05:52:32,648 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-08 05:52:32,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 05:52:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:52:32,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 05:52:32,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-08 05:52:32,649 INFO L87 Difference]: Start difference. First operand 578 states and 720 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-08 05:52:35,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:52:35,944 INFO L93 Difference]: Finished difference Result 613 states and 769 transitions. [2022-04-08 05:52:35,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 05:52:35,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) Word has length 123 [2022-04-08 05:52:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:52:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-08 05:52:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-08 05:52:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-08 05:52:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2022-04-08 05:52:35,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 138 transitions. [2022-04-08 05:52:36,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:52:36,115 INFO L225 Difference]: With dead ends: 613 [2022-04-08 05:52:36,115 INFO L226 Difference]: Without dead ends: 611 [2022-04-08 05:52:36,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-08 05:52:36,124 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 39 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 05:52:36,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 363 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 05:52:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-08 05:52:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 605. [2022-04-08 05:52:37,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:52:37,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:52:37,605 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:52:37,605 INFO L87 Difference]: Start difference. First operand 611 states. Second operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:52:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:52:37,638 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-08 05:52:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-08 05:52:37,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:52:37,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:52:37,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 611 states. [2022-04-08 05:52:37,640 INFO L87 Difference]: Start difference. First operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 611 states. [2022-04-08 05:52:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:52:37,652 INFO L93 Difference]: Finished difference Result 611 states and 767 transitions. [2022-04-08 05:52:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 767 transitions. [2022-04-08 05:52:37,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:52:37,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:52:37,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:52:37,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:52:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 397 states have (on average 1.1964735516372795) internal successors, (475), 404 states have internal predecessors, (475), 145 states have call successors, (145), 64 states have call predecessors, (145), 62 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:52:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 761 transitions. [2022-04-08 05:52:37,670 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 761 transitions. Word has length 123 [2022-04-08 05:52:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:52:37,670 INFO L478 AbstractCegarLoop]: Abstraction has 605 states and 761 transitions. [2022-04-08 05:52:37,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 8 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-08 05:52:37,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 605 states and 761 transitions. [2022-04-08 05:52:39,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 761 edges. 761 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:52:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 761 transitions. [2022-04-08 05:52:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-08 05:52:39,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:52:39,199 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:52:39,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 05:52:39,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:52:39,400 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:52:39,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:52:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 9 times [2022-04-08 05:52:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:52:39,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184917214] [2022-04-08 05:52:39,400 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:52:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash -270396677, now seen corresponding path program 10 times [2022-04-08 05:52:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:52:39,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747887742] [2022-04-08 05:52:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:52:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:52:39,413 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:52:39,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910754812] [2022-04-08 05:52:39,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:52:39,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:52:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:52:39,423 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:52:39,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 05:52:39,493 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:52:39,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:52:39,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-08 05:52:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:52:39,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:52:41,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {66204#true} call ULTIMATE.init(); {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {66204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66204#true} {66204#true} #98#return; {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {66204#true} call #t~ret8 := main(); {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {66204#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {66204#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66204#true} {66204#true} #78#return; {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L272 TraceCheckUtils]: 11: Hoare triple {66204#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66204#true} {66204#true} #80#return; {66204#true} is VALID [2022-04-08 05:52:41,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {66204#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; {66257#(and (= main_~r~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-08 05:52:41,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {66257#(and (= main_~r~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 assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,060 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66204#true} {66257#(and (= main_~r~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))} #82#return; {66257#(and (= main_~r~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-08 05:52:41,061 INFO L272 TraceCheckUtils]: 22: Hoare triple {66257#(and (= main_~r~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 assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,061 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66204#true} {66257#(and (= main_~r~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))} #84#return; {66257#(and (= main_~r~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-08 05:52:41,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {66257#(and (= main_~r~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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66257#(and (= main_~r~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-08 05:52:41,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {66257#(and (= main_~r~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 !!(#t~post6 < 10);havoc #t~post6; {66257#(and (= main_~r~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-08 05:52:41,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {66257#(and (= main_~r~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 !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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-08 05:52:41,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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-08 05:52:41,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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 !!(#t~post7 < 10);havoc #t~post7; {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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-08 05:52:41,064 INFO L272 TraceCheckUtils]: 32: Hoare triple {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {66204#true} is VALID [2022-04-08 05:52:41,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,065 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66204#true} {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #86#return; {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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-08 05:52:41,065 INFO L272 TraceCheckUtils]: 37: Hoare triple {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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)); {66204#true} is VALID [2022-04-08 05:52:41,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:52:41,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:41,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:41,067 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66297#(and (= main_~r~0 0) (= main_~c~0 main_~a~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))} #88#return; {66336#(and (= main_~r~0 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-08 05:52:41,067 INFO L272 TraceCheckUtils]: 42: Hoare triple {66336#(and (= main_~r~0 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)); {66204#true} is VALID [2022-04-08 05:52:41,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:52:41,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:41,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:41,068 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66336#(and (= main_~r~0 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))} #90#return; {66336#(and (= main_~r~0 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-08 05:52:41,068 INFO L272 TraceCheckUtils]: 47: Hoare triple {66336#(and (= main_~r~0 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)); {66204#true} is VALID [2022-04-08 05:52:41,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,069 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66204#true} {66336#(and (= main_~r~0 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))} #92#return; {66336#(and (= main_~r~0 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-08 05:52:41,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {66336#(and (= main_~r~0 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); {66336#(and (= main_~r~0 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-08 05:52:41,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {66336#(and (= main_~r~0 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))} ~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; {66373#(and (= main_~s~0 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-08 05:52:41,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {66373#(and (= main_~s~0 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)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66373#(and (= main_~s~0 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-08 05:52:41,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {66373#(and (= main_~s~0 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 !!(#t~post6 < 10);havoc #t~post6; {66373#(and (= main_~s~0 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-08 05:52:41,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {66373#(and (= main_~s~0 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; {66383#(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_~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-08 05:52:41,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {66383#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66383#(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_~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-08 05:52:41,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {66383#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {66383#(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_~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-08 05:52:41,073 INFO L272 TraceCheckUtils]: 59: Hoare triple {66383#(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_~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)); {66204#true} is VALID [2022-04-08 05:52:41,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,073 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66204#true} {66383#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #86#return; {66383#(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_~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-08 05:52:41,074 INFO L272 TraceCheckUtils]: 64: Hoare triple {66383#(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_~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)); {66204#true} is VALID [2022-04-08 05:52:41,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,074 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,074 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,075 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66204#true} {66383#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #88#return; {66383#(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_~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-08 05:52:41,075 INFO L272 TraceCheckUtils]: 69: Hoare triple {66383#(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_~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)); {66204#true} is VALID [2022-04-08 05:52:41,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,075 INFO L290 TraceCheckUtils]: 71: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,075 INFO L290 TraceCheckUtils]: 72: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,076 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66204#true} {66383#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #90#return; {66383#(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_~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-08 05:52:41,076 INFO L272 TraceCheckUtils]: 74: Hoare triple {66383#(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_~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)); {66204#true} is VALID [2022-04-08 05:52:41,076 INFO L290 TraceCheckUtils]: 75: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,077 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {66204#true} {66383#(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_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 1) (= main_~xy~0 (* main_~y~0 main_~x~0)))} #92#return; {66383#(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_~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-08 05:52:41,077 INFO L290 TraceCheckUtils]: 79: Hoare triple {66383#(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_~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; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,077 INFO L290 TraceCheckUtils]: 80: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} assume !!(#t~post7 < 10);havoc #t~post7; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,078 INFO L272 TraceCheckUtils]: 82: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,079 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} #86#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,079 INFO L272 TraceCheckUtils]: 87: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,079 INFO L290 TraceCheckUtils]: 90: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,080 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} #88#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,080 INFO L272 TraceCheckUtils]: 92: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:52:41,080 INFO L290 TraceCheckUtils]: 93: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,080 INFO L290 TraceCheckUtils]: 94: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,080 INFO L290 TraceCheckUtils]: 95: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,081 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} #90#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,081 INFO L272 TraceCheckUtils]: 97: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} 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)); {66204#true} is VALID [2022-04-08 05:52:41,081 INFO L290 TraceCheckUtils]: 98: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,081 INFO L290 TraceCheckUtils]: 99: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,081 INFO L290 TraceCheckUtils]: 100: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,082 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {66204#true} {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} #92#return; {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,082 INFO L290 TraceCheckUtils]: 102: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} assume !(~c~0 >= ~b~0); {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} is VALID [2022-04-08 05:52:41,083 INFO L290 TraceCheckUtils]: 103: Hoare triple {66453#(and (= main_~x~0 (+ (* (- 1) main_~c~0) main_~y~0)) (= main_~s~0 0) (= main_~p~0 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)))} ~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; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,083 INFO L290 TraceCheckUtils]: 104: Hoare triple {66526#(and (= main_~s~0 1) (= 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)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,084 INFO L290 TraceCheckUtils]: 105: Hoare triple {66526#(and (= main_~s~0 1) (= 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 !!(#t~post6 < 10);havoc #t~post6; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,084 INFO L290 TraceCheckUtils]: 106: Hoare triple {66526#(and (= main_~s~0 1) (= 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; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {66526#(and (= main_~s~0 1) (= 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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {66526#(and (= main_~s~0 1) (= 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 !!(#t~post7 < 10);havoc #t~post7; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,085 INFO L272 TraceCheckUtils]: 109: Hoare triple {66526#(and (= main_~s~0 1) (= 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)); {66204#true} is VALID [2022-04-08 05:52:41,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,085 INFO L290 TraceCheckUtils]: 111: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,085 INFO L290 TraceCheckUtils]: 112: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,086 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66204#true} {66526#(and (= main_~s~0 1) (= 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)))} #86#return; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,086 INFO L272 TraceCheckUtils]: 114: Hoare triple {66526#(and (= main_~s~0 1) (= 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)); {66204#true} is VALID [2022-04-08 05:52:41,086 INFO L290 TraceCheckUtils]: 115: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:52:41,086 INFO L290 TraceCheckUtils]: 116: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:52:41,086 INFO L290 TraceCheckUtils]: 117: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:52:41,087 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {66204#true} {66526#(and (= main_~s~0 1) (= 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)))} #88#return; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,087 INFO L272 TraceCheckUtils]: 119: Hoare triple {66526#(and (= main_~s~0 1) (= 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)); {66204#true} is VALID [2022-04-08 05:52:41,087 INFO L290 TraceCheckUtils]: 120: Hoare triple {66204#true} ~cond := #in~cond; {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:52:41,088 INFO L290 TraceCheckUtils]: 121: Hoare triple {66325#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:41,088 INFO L290 TraceCheckUtils]: 122: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:52:41,089 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66526#(and (= main_~s~0 1) (= 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)))} #90#return; {66526#(and (= main_~s~0 1) (= 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-08 05:52:41,091 INFO L272 TraceCheckUtils]: 124: Hoare triple {66526#(and (= main_~s~0 1) (= 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)); {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:52:41,091 INFO L290 TraceCheckUtils]: 125: Hoare triple {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66594#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:52:41,092 INFO L290 TraceCheckUtils]: 126: Hoare triple {66594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66205#false} is VALID [2022-04-08 05:52:41,092 INFO L290 TraceCheckUtils]: 127: Hoare triple {66205#false} assume !false; {66205#false} is VALID [2022-04-08 05:52:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 69 proven. 118 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-08 05:52:41,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:53:50,452 INFO L290 TraceCheckUtils]: 127: Hoare triple {66205#false} assume !false; {66205#false} is VALID [2022-04-08 05:53:50,452 INFO L290 TraceCheckUtils]: 126: Hoare triple {66594#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {66205#false} is VALID [2022-04-08 05:53:50,452 INFO L290 TraceCheckUtils]: 125: Hoare triple {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {66594#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:53:50,453 INFO L272 TraceCheckUtils]: 124: Hoare triple {66610#(= (+ (* 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)); {66590#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:53:50,454 INFO L284 TraceCheckUtils]: 123: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66614#(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)))))} #90#return; {66610#(= (+ (* 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-08 05:53:50,454 INFO L290 TraceCheckUtils]: 122: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:53:50,454 INFO L290 TraceCheckUtils]: 121: Hoare triple {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:53:50,454 INFO L290 TraceCheckUtils]: 120: Hoare triple {66204#true} ~cond := #in~cond; {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:53:50,455 INFO L272 TraceCheckUtils]: 119: Hoare triple {66614#(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)); {66204#true} is VALID [2022-04-08 05:53:50,455 INFO L284 TraceCheckUtils]: 118: Hoare quadruple {66204#true} {66614#(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)))))} #88#return; {66614#(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-08 05:53:50,455 INFO L290 TraceCheckUtils]: 117: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:50,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:50,455 INFO L290 TraceCheckUtils]: 115: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:50,455 INFO L272 TraceCheckUtils]: 114: Hoare triple {66614#(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)); {66204#true} is VALID [2022-04-08 05:53:50,456 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66204#true} {66614#(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)))))} #86#return; {66614#(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-08 05:53:50,456 INFO L290 TraceCheckUtils]: 112: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:50,456 INFO L290 TraceCheckUtils]: 111: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:50,456 INFO L290 TraceCheckUtils]: 110: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:50,456 INFO L272 TraceCheckUtils]: 109: Hoare triple {66614#(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)); {66204#true} is VALID [2022-04-08 05:53:50,457 INFO L290 TraceCheckUtils]: 108: Hoare triple {66614#(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 !!(#t~post7 < 10);havoc #t~post7; {66614#(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-08 05:53:50,457 INFO L290 TraceCheckUtils]: 107: Hoare triple {66614#(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)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66614#(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-08 05:53:50,457 INFO L290 TraceCheckUtils]: 106: Hoare triple {66614#(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; {66614#(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-08 05:53:50,458 INFO L290 TraceCheckUtils]: 105: Hoare triple {66614#(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 !!(#t~post6 < 10);havoc #t~post6; {66614#(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-08 05:53:50,458 INFO L290 TraceCheckUtils]: 104: Hoare triple {66614#(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)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66614#(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-08 05:53:52,460 WARN L290 TraceCheckUtils]: 103: Hoare triple {66676#(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; {66614#(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-08 05:53:52,461 INFO L290 TraceCheckUtils]: 102: Hoare triple {66676#(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)))} assume !(~c~0 >= ~b~0); {66676#(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-08 05:53:52,462 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {66204#true} {66676#(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)))} #92#return; {66676#(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-08 05:53:52,462 INFO L290 TraceCheckUtils]: 100: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,462 INFO L290 TraceCheckUtils]: 99: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,462 INFO L290 TraceCheckUtils]: 98: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,462 INFO L272 TraceCheckUtils]: 97: Hoare triple {66676#(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)))} 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)); {66204#true} is VALID [2022-04-08 05:53:52,463 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {66204#true} {66676#(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)))} #90#return; {66676#(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-08 05:53:52,463 INFO L290 TraceCheckUtils]: 95: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,463 INFO L290 TraceCheckUtils]: 94: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,463 INFO L290 TraceCheckUtils]: 93: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,463 INFO L272 TraceCheckUtils]: 92: Hoare triple {66676#(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)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:52,464 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {66204#true} {66676#(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)))} #88#return; {66676#(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-08 05:53:52,464 INFO L290 TraceCheckUtils]: 90: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,464 INFO L290 TraceCheckUtils]: 89: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,464 INFO L290 TraceCheckUtils]: 88: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,464 INFO L272 TraceCheckUtils]: 87: Hoare triple {66676#(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)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:52,465 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {66204#true} {66676#(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)))} #86#return; {66676#(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-08 05:53:52,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,465 INFO L290 TraceCheckUtils]: 84: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,465 INFO L290 TraceCheckUtils]: 83: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,465 INFO L272 TraceCheckUtils]: 82: Hoare triple {66676#(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)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:52,465 INFO L290 TraceCheckUtils]: 81: Hoare triple {66676#(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)))} assume !!(#t~post7 < 10);havoc #t~post7; {66676#(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-08 05:53:52,466 INFO L290 TraceCheckUtils]: 80: Hoare triple {66676#(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)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66676#(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-08 05:53:52,792 INFO L290 TraceCheckUtils]: 79: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {66676#(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-08 05:53:52,793 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ 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)))))))} #92#return; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,794 INFO L290 TraceCheckUtils]: 76: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,794 INFO L290 TraceCheckUtils]: 75: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,794 INFO L272 TraceCheckUtils]: 74: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} 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)); {66204#true} is VALID [2022-04-08 05:53:52,794 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ 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)))))))} #90#return; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,795 INFO L290 TraceCheckUtils]: 70: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,795 INFO L272 TraceCheckUtils]: 69: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:52,795 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ 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)))))))} #88#return; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,796 INFO L272 TraceCheckUtils]: 64: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:52,797 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66204#true} {66749#(or (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)))) (= (+ (* (+ 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)))))))} #86#return; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,797 INFO L290 TraceCheckUtils]: 62: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:52,797 INFO L290 TraceCheckUtils]: 61: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:52,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:52,797 INFO L272 TraceCheckUtils]: 59: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:52,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} assume !!(#t~post7 < 10);havoc #t~post7; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,798 INFO L290 TraceCheckUtils]: 57: Hoare triple {66749#(or (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)))) (= (+ (* (+ 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)))))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {66749#(or (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)))) (= (+ (* (+ 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)))))))} is VALID [2022-04-08 05:53:52,844 INFO L290 TraceCheckUtils]: 55: Hoare triple {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} assume !!(#t~post6 < 10);havoc #t~post6; {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-08 05:53:52,845 INFO L290 TraceCheckUtils]: 54: Hoare triple {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is VALID [2022-04-08 05:53:54,847 WARN L290 TraceCheckUtils]: 53: Hoare triple {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) 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; {66819#(or (= (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~y~0 (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)))) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~yy~0) (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) (* (- 1) main_~q~0 main_~x~0) (* main_~xy~0 (+ main_~p~0 (* (- 1) main_~q~0))) (* main_~p~0 main_~x~0))) (not (= (+ (* (- 1) main_~y~0 main_~s~0) (* main_~y~0 main_~r~0) main_~b~0 (* (- 1) main_~q~0 main_~x~0) (* main_~p~0 main_~x~0)) main_~a~0)))} is UNKNOWN [2022-04-08 05:53:54,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} assume !(~c~0 >= ~b~0); {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,849 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {66204#true} {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #92#return; {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:54,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:54,849 INFO L272 TraceCheckUtils]: 47: Hoare triple {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~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)); {66204#true} is VALID [2022-04-08 05:53:54,850 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66851#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #90#return; {66829#(or (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:53:54,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:53:54,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {66204#true} ~cond := #in~cond; {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:53:54,851 INFO L272 TraceCheckUtils]: 42: Hoare triple {66851#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,852 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #88#return; {66851#(or (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,853 INFO L290 TraceCheckUtils]: 40: Hoare triple {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:53:54,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {66329#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:53:54,853 INFO L290 TraceCheckUtils]: 38: Hoare triple {66204#true} ~cond := #in~cond; {66624#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:53:54,853 INFO L272 TraceCheckUtils]: 37: Hoare triple {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,854 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {66204#true} {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #86#return; {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:54,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:54,855 INFO L272 TraceCheckUtils]: 32: Hoare triple {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} assume !!(#t~post7 < 10);havoc #t~post7; {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {66904#(or (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_~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))))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {66867#(or (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)))) (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) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)))) (= (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~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))) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) (+ (* main_~x~0 (+ main_~q~0 (* (- 1) (* (- 1) main_~q~0 main_~k~0)) (* (- 1) main_~p~0))) (* (+ (* (- 1) (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* main_~q~0 main_~x~0) (* (- 1) (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0) (* main_~y~0 main_~s~0)) main_~y~0) (* (+ (* main_~k~0 main_~s~0) main_~s~0 (* (- 1) main_~r~0)) main_~y~0))))} is VALID [2022-04-08 05:53:54,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {66904#(or (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_~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))))} assume !!(#t~post6 < 10);havoc #t~post6; {66904#(or (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_~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))))} is VALID [2022-04-08 05:53:54,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {66904#(or (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_~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))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66904#(or (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_~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))))} is VALID [2022-04-08 05:53:54,859 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {66204#true} {66904#(or (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_~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))))} #84#return; {66904#(or (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_~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))))} is VALID [2022-04-08 05:53:54,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:54,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:54,859 INFO L272 TraceCheckUtils]: 22: Hoare triple {66904#(or (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_~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))))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,860 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {66204#true} {66904#(or (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_~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))))} #82#return; {66904#(or (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_~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))))} is VALID [2022-04-08 05:53:54,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:54,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:54,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {66904#(or (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_~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))))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {66204#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; {66904#(or (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_~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))))} is VALID [2022-04-08 05:53:54,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66204#true} {66204#true} #80#return; {66204#true} is VALID [2022-04-08 05:53:54,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L272 TraceCheckUtils]: 11: Hoare triple {66204#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66204#true} {66204#true} #78#return; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {66204#true} assume !(0 == ~cond); {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {66204#true} ~cond := #in~cond; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {66204#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {66204#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {66204#true} call #t~ret8 := main(); {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66204#true} {66204#true} #98#return; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {66204#true} assume true; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {66204#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {66204#true} is VALID [2022-04-08 05:53:54,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {66204#true} call ULTIMATE.init(); {66204#true} is VALID [2022-04-08 05:53:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 79 proven. 107 refuted. 1 times theorem prover too weak. 336 trivial. 0 not checked. [2022-04-08 05:53:54,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:53:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747887742] [2022-04-08 05:53:54,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:53:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910754812] [2022-04-08 05:53:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910754812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:53:54,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:53:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 23 [2022-04-08 05:53:54,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:53:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184917214] [2022-04-08 05:53:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184917214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:53:54,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:53:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 05:53:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514850738] [2022-04-08 05:53:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:53:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 128 [2022-04-08 05:53:54,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:53:54,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-08 05:53:54,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:53:54,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 05:53:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:53:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 05:53:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=385, Unknown=2, NotChecked=0, Total=506 [2022-04-08 05:53:54,974 INFO L87 Difference]: Start difference. First operand 605 states and 761 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-08 05:54:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:54:09,458 INFO L93 Difference]: Finished difference Result 617 states and 772 transitions. [2022-04-08 05:54:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 05:54:09,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) Word has length 128 [2022-04-08 05:54:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:54:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-08 05:54:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-08 05:54:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-08 05:54:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 138 transitions. [2022-04-08 05:54:09,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 138 transitions. [2022-04-08 05:54:09,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:54:09,708 INFO L225 Difference]: With dead ends: 617 [2022-04-08 05:54:09,708 INFO L226 Difference]: Without dead ends: 615 [2022-04-08 05:54:09,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=158, Invalid=542, Unknown=2, NotChecked=0, Total=702 [2022-04-08 05:54:09,709 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 05:54:09,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 369 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 05:54:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-04-08 05:54:11,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 609. [2022-04-08 05:54:11,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:54:11,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:54:11,192 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:54:11,192 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:54:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:54:11,204 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-08 05:54:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-08 05:54:11,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:54:11,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:54:11,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 615 states. [2022-04-08 05:54:11,206 INFO L87 Difference]: Start difference. First operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) Second operand 615 states. [2022-04-08 05:54:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:54:11,218 INFO L93 Difference]: Finished difference Result 615 states and 770 transitions. [2022-04-08 05:54:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 770 transitions. [2022-04-08 05:54:11,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:54:11,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:54:11,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:54:11,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:54:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 400 states have (on average 1.195) internal successors, (478), 407 states have internal predecessors, (478), 145 states have call successors, (145), 65 states have call predecessors, (145), 63 states have return successors, (141), 136 states have call predecessors, (141), 141 states have call successors, (141) [2022-04-08 05:54:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 764 transitions. [2022-04-08 05:54:11,235 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 764 transitions. Word has length 128 [2022-04-08 05:54:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:54:11,235 INFO L478 AbstractCegarLoop]: Abstraction has 609 states and 764 transitions. [2022-04-08 05:54:11,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 7 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 7 states have call predecessors, (20), 7 states have call successors, (20) [2022-04-08 05:54:11,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 609 states and 764 transitions. [2022-04-08 05:54:12,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 764 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:54:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 764 transitions. [2022-04-08 05:54:12,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-08 05:54:12,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:54:12,674 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-08 05:54:12,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 05:54:12,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-08 05:54:12,888 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:54:12,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:54:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 7 times [2022-04-08 05:54:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:54:12,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211774901] [2022-04-08 05:54:12,888 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:54:12,888 INFO L85 PathProgramCache]: Analyzing trace with hash -677811269, now seen corresponding path program 8 times [2022-04-08 05:54:12,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:54:12,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440012837] [2022-04-08 05:54:12,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:54:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:54:12,923 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:54:12,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771835762] [2022-04-08 05:54:12,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:54:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:54:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:54:12,931 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:54:12,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 05:54:13,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:54:13,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:54:13,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-08 05:54:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:54:13,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:54:14,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {70684#true} call ULTIMATE.init(); {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {70684#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70684#true} {70684#true} #98#return; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {70684#true} call #t~ret8 := main(); {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {70684#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L272 TraceCheckUtils]: 6: Hoare triple {70684#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70684#true} {70684#true} #78#return; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L272 TraceCheckUtils]: 11: Hoare triple {70684#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,257 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70684#true} {70684#true} #80#return; {70684#true} is VALID [2022-04-08 05:54:14,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {70684#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; {70737#(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-08 05:54:14,257 INFO L272 TraceCheckUtils]: 17: Hoare triple {70737#(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)); {70684#true} is VALID [2022-04-08 05:54:14,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,258 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70684#true} {70737#(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))} #82#return; {70737#(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-08 05:54:14,258 INFO L272 TraceCheckUtils]: 22: Hoare triple {70737#(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)); {70684#true} is VALID [2022-04-08 05:54:14,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,258 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70684#true} {70737#(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))} #84#return; {70737#(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-08 05:54:14,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {70737#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70737#(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-08 05:54:14,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {70737#(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 !!(#t~post6 < 10);havoc #t~post6; {70737#(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-08 05:54:14,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {70737#(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; {70777#(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-08 05:54:14,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {70777#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70777#(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-08 05:54:14,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {70777#(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 !!(#t~post7 < 10);havoc #t~post7; {70777#(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-08 05:54:14,260 INFO L272 TraceCheckUtils]: 32: Hoare triple {70777#(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)); {70684#true} is VALID [2022-04-08 05:54:14,260 INFO L290 TraceCheckUtils]: 33: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,260 INFO L290 TraceCheckUtils]: 34: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,260 INFO L290 TraceCheckUtils]: 35: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,261 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70684#true} {70777#(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))} #86#return; {70777#(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-08 05:54:14,261 INFO L272 TraceCheckUtils]: 37: Hoare triple {70777#(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)); {70684#true} is VALID [2022-04-08 05:54:14,261 INFO L290 TraceCheckUtils]: 38: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,261 INFO L290 TraceCheckUtils]: 39: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,261 INFO L290 TraceCheckUtils]: 40: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,262 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70684#true} {70777#(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))} #88#return; {70777#(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-08 05:54:14,262 INFO L272 TraceCheckUtils]: 42: Hoare triple {70777#(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)); {70684#true} is VALID [2022-04-08 05:54:14,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,262 INFO L290 TraceCheckUtils]: 44: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,262 INFO L290 TraceCheckUtils]: 45: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,262 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70684#true} {70777#(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))} #90#return; {70777#(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-08 05:54:14,262 INFO L272 TraceCheckUtils]: 47: Hoare triple {70777#(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)); {70684#true} is VALID [2022-04-08 05:54:14,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,263 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70684#true} {70777#(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))} #92#return; {70777#(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-08 05:54:14,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {70777#(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; {70847#(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-08 05:54:14,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {70847#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70847#(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-08 05:54:14,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {70847#(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 !!(#t~post7 < 10);havoc #t~post7; {70847#(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-08 05:54:14,266 INFO L272 TraceCheckUtils]: 55: Hoare triple {70847#(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)); {70684#true} is VALID [2022-04-08 05:54:14,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,267 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70684#true} {70847#(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))} #86#return; {70847#(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-08 05:54:14,267 INFO L272 TraceCheckUtils]: 60: Hoare triple {70847#(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)); {70684#true} is VALID [2022-04-08 05:54:14,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,268 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70684#true} {70847#(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))} #88#return; {70847#(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-08 05:54:14,268 INFO L272 TraceCheckUtils]: 65: Hoare triple {70847#(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)); {70684#true} is VALID [2022-04-08 05:54:14,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,268 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70684#true} {70847#(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))} #90#return; {70847#(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-08 05:54:14,268 INFO L272 TraceCheckUtils]: 70: Hoare triple {70847#(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)); {70684#true} is VALID [2022-04-08 05:54:14,269 INFO L290 TraceCheckUtils]: 71: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,269 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70684#true} {70847#(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))} #92#return; {70847#(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-08 05:54:14,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {70847#(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; {70917#(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-08 05:54:14,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {70917#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70917#(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-08 05:54:14,271 INFO L290 TraceCheckUtils]: 77: Hoare triple {70917#(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 !!(#t~post7 < 10);havoc #t~post7; {70917#(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-08 05:54:14,271 INFO L272 TraceCheckUtils]: 78: Hoare triple {70917#(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)); {70684#true} is VALID [2022-04-08 05:54:14,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,271 INFO L290 TraceCheckUtils]: 81: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,272 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70684#true} {70917#(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))} #86#return; {70917#(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-08 05:54:14,272 INFO L272 TraceCheckUtils]: 83: Hoare triple {70917#(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)); {70684#true} is VALID [2022-04-08 05:54:14,272 INFO L290 TraceCheckUtils]: 84: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,272 INFO L290 TraceCheckUtils]: 85: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,272 INFO L290 TraceCheckUtils]: 86: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,272 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70684#true} {70917#(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))} #88#return; {70917#(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-08 05:54:14,272 INFO L272 TraceCheckUtils]: 88: Hoare triple {70917#(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)); {70684#true} is VALID [2022-04-08 05:54:14,272 INFO L290 TraceCheckUtils]: 89: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,273 INFO L290 TraceCheckUtils]: 90: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,273 INFO L290 TraceCheckUtils]: 91: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,273 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70684#true} {70917#(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))} #90#return; {70917#(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-08 05:54:14,273 INFO L272 TraceCheckUtils]: 93: Hoare triple {70917#(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)); {70684#true} is VALID [2022-04-08 05:54:14,273 INFO L290 TraceCheckUtils]: 94: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,273 INFO L290 TraceCheckUtils]: 95: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,274 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70684#true} {70917#(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))} #92#return; {70917#(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-08 05:54:14,275 INFO L290 TraceCheckUtils]: 98: Hoare triple {70917#(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; {70987#(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-08 05:54:14,275 INFO L290 TraceCheckUtils]: 99: Hoare triple {70987#(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))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70987#(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-08 05:54:14,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {70987#(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 !!(#t~post7 < 10);havoc #t~post7; {70987#(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-08 05:54:14,276 INFO L272 TraceCheckUtils]: 101: Hoare triple {70987#(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)); {70684#true} is VALID [2022-04-08 05:54:14,276 INFO L290 TraceCheckUtils]: 102: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:54:14,276 INFO L290 TraceCheckUtils]: 103: Hoare triple {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:14,276 INFO L290 TraceCheckUtils]: 104: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:14,277 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {70987#(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))} #86#return; {71011#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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-08 05:54:14,277 INFO L272 TraceCheckUtils]: 106: Hoare triple {71011#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:54:14,277 INFO L290 TraceCheckUtils]: 107: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:54:14,278 INFO L290 TraceCheckUtils]: 108: Hoare triple {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:14,278 INFO L290 TraceCheckUtils]: 109: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:14,280 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71011#(and (= main_~r~0 0) (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~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))} #88#return; {71027#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (* main_~b~0 main_~k~0) (* main_~b~0 3)) (= main_~p~0 1))} is VALID [2022-04-08 05:54:14,280 INFO L272 TraceCheckUtils]: 111: Hoare triple {71027#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (* main_~b~0 main_~k~0) (* main_~b~0 3)) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:54:14,280 INFO L290 TraceCheckUtils]: 112: Hoare triple {70684#true} ~cond := #in~cond; {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:54:14,280 INFO L290 TraceCheckUtils]: 113: Hoare triple {71000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:14,280 INFO L290 TraceCheckUtils]: 114: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:54:14,281 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71027#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (* main_~b~0 main_~k~0) (* main_~b~0 3)) (= main_~p~0 1))} #90#return; {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:54:14,281 INFO L272 TraceCheckUtils]: 116: Hoare triple {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= 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)); {70684#true} is VALID [2022-04-08 05:54:14,281 INFO L290 TraceCheckUtils]: 117: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:54:14,281 INFO L290 TraceCheckUtils]: 118: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:54:14,281 INFO L290 TraceCheckUtils]: 119: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:54:14,282 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {70684#true} {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} #92#return; {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:54:14,282 INFO L290 TraceCheckUtils]: 121: Hoare triple {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-08 05:54:14,285 INFO L290 TraceCheckUtils]: 122: Hoare triple {71043#(and (= main_~r~0 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_~q~0 main_~x~0) 3) (* 3 (* main_~y~0 main_~s~0))) (+ (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0))) (= main_~s~0 1) (= 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; {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-08 05:54:14,286 INFO L290 TraceCheckUtils]: 123: Hoare triple {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-08 05:54:14,286 INFO L290 TraceCheckUtils]: 124: Hoare triple {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} is VALID [2022-04-08 05:54:14,286 INFO L290 TraceCheckUtils]: 125: Hoare triple {71065#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) main_~b~0) (= main_~q~0 1))} assume !(0 != ~b~0); {71075#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= main_~q~0 1))} is VALID [2022-04-08 05:54:14,287 INFO L272 TraceCheckUtils]: 126: Hoare triple {71075#(and (= (+ (* main_~y~0 (* (- 1) main_~s~0) 1) (* main_~x~0 (* (- 1) main_~s~0) 0)) (* main_~y~0 3)) (= (+ main_~x~0 (* main_~y~0 main_~s~0)) 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:54:14,287 INFO L290 TraceCheckUtils]: 127: Hoare triple {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {71083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:54:14,287 INFO L290 TraceCheckUtils]: 128: Hoare triple {71083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70685#false} is VALID [2022-04-08 05:54:14,287 INFO L290 TraceCheckUtils]: 129: Hoare triple {70685#false} assume !false; {70685#false} is VALID [2022-04-08 05:54:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 137 proven. 57 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2022-04-08 05:54:14,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:56:20,265 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:56:54,284 INFO L290 TraceCheckUtils]: 129: Hoare triple {70685#false} assume !false; {70685#false} is VALID [2022-04-08 05:56:54,284 INFO L290 TraceCheckUtils]: 128: Hoare triple {71083#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {70685#false} is VALID [2022-04-08 05:56:54,285 INFO L290 TraceCheckUtils]: 127: Hoare triple {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {71083#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:56:54,285 INFO L272 TraceCheckUtils]: 126: Hoare triple {71099#(= (+ (* 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)); {71079#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:56:54,285 INFO L290 TraceCheckUtils]: 125: Hoare triple {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !(0 != ~b~0); {71099#(= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0)} is VALID [2022-04-08 05:56:54,286 INFO L290 TraceCheckUtils]: 124: Hoare triple {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} assume !!(#t~post6 < 10);havoc #t~post6; {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:56:54,286 INFO L290 TraceCheckUtils]: 123: Hoare triple {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:56:54,630 INFO L290 TraceCheckUtils]: 122: Hoare triple {71113#(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; {71103#(or (not (= main_~b~0 0)) (= (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)) 0))} is VALID [2022-04-08 05:56:54,630 INFO L290 TraceCheckUtils]: 121: Hoare triple {71113#(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))} assume !(~c~0 >= ~b~0); {71113#(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-08 05:56:54,631 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {70684#true} {71113#(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))} #92#return; {71113#(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-08 05:56:54,631 INFO L290 TraceCheckUtils]: 119: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,631 INFO L290 TraceCheckUtils]: 118: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,631 INFO L290 TraceCheckUtils]: 117: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,632 INFO L272 TraceCheckUtils]: 116: Hoare triple {71113#(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))} 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)); {70684#true} is VALID [2022-04-08 05:56:54,632 INFO L284 TraceCheckUtils]: 115: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71135#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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))} #90#return; {71113#(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-08 05:56:54,633 INFO L290 TraceCheckUtils]: 114: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:56:54,633 INFO L290 TraceCheckUtils]: 113: Hoare triple {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:56:54,633 INFO L290 TraceCheckUtils]: 112: Hoare triple {70684#true} ~cond := #in~cond; {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:56:54,633 INFO L272 TraceCheckUtils]: 111: Hoare triple {71135#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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)); {70684#true} is VALID [2022-04-08 05:56:54,634 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {71152#(or (not (= main_~c~0 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_~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))} #88#return; {71135#(or (not (= main_~c~0 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~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-08 05:56:54,635 INFO L290 TraceCheckUtils]: 109: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:56:54,635 INFO L290 TraceCheckUtils]: 108: Hoare triple {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:56:54,635 INFO L290 TraceCheckUtils]: 107: Hoare triple {70684#true} ~cond := #in~cond; {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:56:54,635 INFO L272 TraceCheckUtils]: 106: Hoare triple {71152#(or (not (= main_~c~0 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_~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)); {70684#true} is VALID [2022-04-08 05:56:54,716 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} {70684#true} #86#return; {71152#(or (not (= main_~c~0 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_~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-08 05:56:54,716 INFO L290 TraceCheckUtils]: 104: Hoare triple {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:56:54,717 INFO L290 TraceCheckUtils]: 103: Hoare triple {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {71004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:56:54,717 INFO L290 TraceCheckUtils]: 102: Hoare triple {70684#true} ~cond := #in~cond; {71145#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 05:56:54,717 INFO L272 TraceCheckUtils]: 101: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,717 INFO L290 TraceCheckUtils]: 100: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,717 INFO L290 TraceCheckUtils]: 99: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,717 INFO L290 TraceCheckUtils]: 98: Hoare triple {70684#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 96: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 95: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 94: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L272 TraceCheckUtils]: 93: Hoare triple {70684#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)); {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 90: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L272 TraceCheckUtils]: 88: Hoare triple {70684#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 86: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 85: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L290 TraceCheckUtils]: 84: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L272 TraceCheckUtils]: 83: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,718 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 81: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 80: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 79: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L272 TraceCheckUtils]: 78: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 76: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 75: Hoare triple {70684#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 72: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 71: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L272 TraceCheckUtils]: 70: Hoare triple {70684#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)); {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 68: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 66: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L272 TraceCheckUtils]: 65: Hoare triple {70684#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L272 TraceCheckUtils]: 60: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L272 TraceCheckUtils]: 55: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {70684#true} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {70684#true} {70684#true} #92#return; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L272 TraceCheckUtils]: 47: Hoare triple {70684#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)); {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {70684#true} {70684#true} #90#return; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 45: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 44: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 43: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L272 TraceCheckUtils]: 42: Hoare triple {70684#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {70684#true} {70684#true} #88#return; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L272 TraceCheckUtils]: 37: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,721 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {70684#true} {70684#true} #86#return; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L272 TraceCheckUtils]: 32: Hoare triple {70684#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {70684#true} assume !!(#t~post7 < 10);havoc #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {70684#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {70684#true} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {70684#true} assume !!(#t~post6 < 10);havoc #t~post6; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {70684#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {70684#true} {70684#true} #84#return; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L272 TraceCheckUtils]: 22: Hoare triple {70684#true} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,722 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {70684#true} {70684#true} #82#return; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L272 TraceCheckUtils]: 17: Hoare triple {70684#true} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {70684#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; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70684#true} {70684#true} #80#return; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L272 TraceCheckUtils]: 11: Hoare triple {70684#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70684#true} {70684#true} #78#return; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {70684#true} assume !(0 == ~cond); {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {70684#true} ~cond := #in~cond; {70684#true} is VALID [2022-04-08 05:56:54,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {70684#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {70684#true} is VALID [2022-04-08 05:56:54,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {70684#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {70684#true} is VALID [2022-04-08 05:56:54,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {70684#true} call #t~ret8 := main(); {70684#true} is VALID [2022-04-08 05:56:54,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70684#true} {70684#true} #98#return; {70684#true} is VALID [2022-04-08 05:56:54,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {70684#true} assume true; {70684#true} is VALID [2022-04-08 05:56:54,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {70684#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {70684#true} is VALID [2022-04-08 05:56:54,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {70684#true} call ULTIMATE.init(); {70684#true} is VALID [2022-04-08 05:56:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 152 proven. 12 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2022-04-08 05:56:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:56:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440012837] [2022-04-08 05:56:54,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:56:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771835762] [2022-04-08 05:56:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771835762] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:56:54,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:56:54,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-04-08 05:56:54,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:56:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211774901] [2022-04-08 05:56:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211774901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:56:54,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:56:54,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 05:56:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517803248] [2022-04-08 05:56:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:56:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 130 [2022-04-08 05:56:54,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:56:54,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-08 05:56:54,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:56:54,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 05:56:54,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:56:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 05:56:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2022-04-08 05:56:54,829 INFO L87 Difference]: Start difference. First operand 609 states and 764 transitions. Second operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-08 05:56:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:56:59,617 INFO L93 Difference]: Finished difference Result 642 states and 811 transitions. [2022-04-08 05:56:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 05:56:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) Word has length 130 [2022-04-08 05:56:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:56:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-08 05:56:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-08 05:56:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-08 05:56:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 138 transitions. [2022-04-08 05:56:59,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 138 transitions. [2022-04-08 05:56:59,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:56:59,807 INFO L225 Difference]: With dead ends: 642 [2022-04-08 05:56:59,807 INFO L226 Difference]: Without dead ends: 637 [2022-04-08 05:56:59,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2022-04-08 05:56:59,808 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 05:56:59,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 370 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 05:56:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-04-08 05:57:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 613. [2022-04-08 05:57:01,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:57:01,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 637 states. Second operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:01,311 INFO L74 IsIncluded]: Start isIncluded. First operand 637 states. Second operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:01,311 INFO L87 Difference]: Start difference. First operand 637 states. Second operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:57:01,324 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-08 05:57:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-08 05:57:01,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:57:01,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:57:01,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 637 states. [2022-04-08 05:57:01,325 INFO L87 Difference]: Start difference. First operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 637 states. [2022-04-08 05:57:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:57:01,338 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2022-04-08 05:57:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 805 transitions. [2022-04-08 05:57:01,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:57:01,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:57:01,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:57:01,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:57:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 401 states have (on average 1.1920199501246882) internal successors, (478), 409 states have internal predecessors, (478), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 769 transitions. [2022-04-08 05:57:01,355 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 769 transitions. Word has length 130 [2022-04-08 05:57:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:57:01,355 INFO L478 AbstractCegarLoop]: Abstraction has 613 states and 769 transitions. [2022-04-08 05:57:01,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 10 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 9 states have call successors, (21) [2022-04-08 05:57:01,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 613 states and 769 transitions. [2022-04-08 05:57:02,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 769 edges. 769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:57:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 769 transitions. [2022-04-08 05:57:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-08 05:57:02,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:57:02,910 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:57:02,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 05:57:03,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-08 05:57:03,111 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:57:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:57:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 7 times [2022-04-08 05:57:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:57:03,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095422519] [2022-04-08 05:57:03,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:57:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2098906485, now seen corresponding path program 8 times [2022-04-08 05:57:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:57:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774680830] [2022-04-08 05:57:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:57:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:57:03,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:57:03,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128409539] [2022-04-08 05:57:03,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 05:57:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:57:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:57:03,127 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:57:03,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 05:57:03,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 05:57:03,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:57:03,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 05:57:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:57:03,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:57:03,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {75275#true} call ULTIMATE.init(); {75275#true} is VALID [2022-04-08 05:57:03,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {75275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75283#(<= ~counter~0 0)} {75275#true} #98#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {75283#(<= ~counter~0 0)} call #t~ret8 := main(); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {75283#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,757 INFO L272 TraceCheckUtils]: 6: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,758 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #78#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,760 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #80#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {75283#(<= ~counter~0 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; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,761 INFO L272 TraceCheckUtils]: 17: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,762 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #82#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,762 INFO L272 TraceCheckUtils]: 22: Hoare triple {75283#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {75283#(<= ~counter~0 0)} ~cond := #in~cond; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {75283#(<= ~counter~0 0)} assume !(0 == ~cond); {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {75283#(<= ~counter~0 0)} assume true; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,763 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75283#(<= ~counter~0 0)} {75283#(<= ~counter~0 0)} #84#return; {75283#(<= ~counter~0 0)} is VALID [2022-04-08 05:57:03,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {75283#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75362#(<= ~counter~0 1)} is VALID [2022-04-08 05:57:03,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {75362#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {75362#(<= ~counter~0 1)} is VALID [2022-04-08 05:57:03,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {75362#(<= ~counter~0 1)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75362#(<= ~counter~0 1)} is VALID [2022-04-08 05:57:03,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {75362#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {75372#(<= ~counter~0 2)} assume !!(#t~post7 < 10);havoc #t~post7; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,767 INFO L272 TraceCheckUtils]: 32: Hoare triple {75372#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,769 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #86#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,769 INFO L272 TraceCheckUtils]: 37: Hoare triple {75372#(<= ~counter~0 2)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,771 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #88#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,771 INFO L272 TraceCheckUtils]: 42: Hoare triple {75372#(<= ~counter~0 2)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,772 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #90#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,773 INFO L272 TraceCheckUtils]: 47: Hoare triple {75372#(<= ~counter~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)); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {75372#(<= ~counter~0 2)} ~cond := #in~cond; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {75372#(<= ~counter~0 2)} assume !(0 == ~cond); {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {75372#(<= ~counter~0 2)} assume true; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,775 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75372#(<= ~counter~0 2)} {75372#(<= ~counter~0 2)} #92#return; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {75372#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75372#(<= ~counter~0 2)} is VALID [2022-04-08 05:57:03,776 INFO L290 TraceCheckUtils]: 53: Hoare triple {75372#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,776 INFO L290 TraceCheckUtils]: 54: Hoare triple {75442#(<= ~counter~0 3)} assume !!(#t~post7 < 10);havoc #t~post7; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,776 INFO L272 TraceCheckUtils]: 55: Hoare triple {75442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,777 INFO L290 TraceCheckUtils]: 56: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,778 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #86#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,778 INFO L272 TraceCheckUtils]: 60: Hoare triple {75442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,780 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #88#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,780 INFO L272 TraceCheckUtils]: 65: Hoare triple {75442#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,780 INFO L290 TraceCheckUtils]: 66: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,781 INFO L290 TraceCheckUtils]: 67: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,782 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #90#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,782 INFO L272 TraceCheckUtils]: 70: Hoare triple {75442#(<= ~counter~0 3)} 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)); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,782 INFO L290 TraceCheckUtils]: 71: Hoare triple {75442#(<= ~counter~0 3)} ~cond := #in~cond; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {75442#(<= ~counter~0 3)} assume !(0 == ~cond); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,784 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75442#(<= ~counter~0 3)} {75442#(<= ~counter~0 3)} #92#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {75442#(<= ~counter~0 3)} assume !(~c~0 >= ~b~0); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,784 INFO L290 TraceCheckUtils]: 76: Hoare triple {75442#(<= ~counter~0 3)} ~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; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:03,785 INFO L290 TraceCheckUtils]: 77: Hoare triple {75442#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-08 05:57:03,785 INFO L290 TraceCheckUtils]: 78: Hoare triple {75515#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-08 05:57:03,785 INFO L290 TraceCheckUtils]: 79: Hoare triple {75515#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75515#(<= ~counter~0 4)} is VALID [2022-04-08 05:57:03,786 INFO L290 TraceCheckUtils]: 80: Hoare triple {75515#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {75525#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,787 INFO L272 TraceCheckUtils]: 82: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,788 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #86#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,789 INFO L272 TraceCheckUtils]: 87: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,789 INFO L290 TraceCheckUtils]: 88: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,789 INFO L290 TraceCheckUtils]: 89: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,790 INFO L290 TraceCheckUtils]: 90: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,790 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #88#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,791 INFO L272 TraceCheckUtils]: 92: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,791 INFO L290 TraceCheckUtils]: 93: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,791 INFO L290 TraceCheckUtils]: 94: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,792 INFO L290 TraceCheckUtils]: 95: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,792 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #90#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,793 INFO L272 TraceCheckUtils]: 97: Hoare triple {75525#(<= ~counter~0 5)} 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)); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,793 INFO L290 TraceCheckUtils]: 98: Hoare triple {75525#(<= ~counter~0 5)} ~cond := #in~cond; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,793 INFO L290 TraceCheckUtils]: 99: Hoare triple {75525#(<= ~counter~0 5)} assume !(0 == ~cond); {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,794 INFO L290 TraceCheckUtils]: 100: Hoare triple {75525#(<= ~counter~0 5)} assume true; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,794 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75525#(<= ~counter~0 5)} {75525#(<= ~counter~0 5)} #92#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,794 INFO L290 TraceCheckUtils]: 102: Hoare triple {75525#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:03,795 INFO L290 TraceCheckUtils]: 103: Hoare triple {75525#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,795 INFO L290 TraceCheckUtils]: 104: Hoare triple {75595#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,796 INFO L272 TraceCheckUtils]: 105: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,796 INFO L290 TraceCheckUtils]: 106: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,797 INFO L290 TraceCheckUtils]: 108: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,797 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #86#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,798 INFO L272 TraceCheckUtils]: 110: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,798 INFO L290 TraceCheckUtils]: 111: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,798 INFO L290 TraceCheckUtils]: 112: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,799 INFO L290 TraceCheckUtils]: 113: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,799 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #88#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,800 INFO L272 TraceCheckUtils]: 115: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,800 INFO L290 TraceCheckUtils]: 116: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,800 INFO L290 TraceCheckUtils]: 117: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,801 INFO L290 TraceCheckUtils]: 118: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,801 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #90#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,802 INFO L272 TraceCheckUtils]: 120: Hoare triple {75595#(<= ~counter~0 6)} 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)); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,802 INFO L290 TraceCheckUtils]: 121: Hoare triple {75595#(<= ~counter~0 6)} ~cond := #in~cond; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,802 INFO L290 TraceCheckUtils]: 122: Hoare triple {75595#(<= ~counter~0 6)} assume !(0 == ~cond); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,803 INFO L290 TraceCheckUtils]: 123: Hoare triple {75595#(<= ~counter~0 6)} assume true; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,803 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75595#(<= ~counter~0 6)} {75595#(<= ~counter~0 6)} #92#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,804 INFO L290 TraceCheckUtils]: 125: Hoare triple {75595#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,804 INFO L290 TraceCheckUtils]: 126: Hoare triple {75595#(<= ~counter~0 6)} ~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; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:03,804 INFO L290 TraceCheckUtils]: 127: Hoare triple {75595#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75668#(<= |main_#t~post6| 6)} is VALID [2022-04-08 05:57:03,804 INFO L290 TraceCheckUtils]: 128: Hoare triple {75668#(<= |main_#t~post6| 6)} assume !(#t~post6 < 10);havoc #t~post6; {75276#false} is VALID [2022-04-08 05:57:03,805 INFO L272 TraceCheckUtils]: 129: Hoare triple {75276#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {75276#false} is VALID [2022-04-08 05:57:03,805 INFO L290 TraceCheckUtils]: 130: Hoare triple {75276#false} ~cond := #in~cond; {75276#false} is VALID [2022-04-08 05:57:03,805 INFO L290 TraceCheckUtils]: 131: Hoare triple {75276#false} assume 0 == ~cond; {75276#false} is VALID [2022-04-08 05:57:03,805 INFO L290 TraceCheckUtils]: 132: Hoare triple {75276#false} assume !false; {75276#false} is VALID [2022-04-08 05:57:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 434 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-08 05:57:03,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 05:57:04,291 INFO L290 TraceCheckUtils]: 132: Hoare triple {75276#false} assume !false; {75276#false} is VALID [2022-04-08 05:57:04,292 INFO L290 TraceCheckUtils]: 131: Hoare triple {75276#false} assume 0 == ~cond; {75276#false} is VALID [2022-04-08 05:57:04,292 INFO L290 TraceCheckUtils]: 130: Hoare triple {75276#false} ~cond := #in~cond; {75276#false} is VALID [2022-04-08 05:57:04,292 INFO L272 TraceCheckUtils]: 129: Hoare triple {75276#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {75276#false} is VALID [2022-04-08 05:57:04,292 INFO L290 TraceCheckUtils]: 128: Hoare triple {75696#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {75276#false} is VALID [2022-04-08 05:57:04,292 INFO L290 TraceCheckUtils]: 127: Hoare triple {75700#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75696#(< |main_#t~post6| 10)} is VALID [2022-04-08 05:57:04,293 INFO L290 TraceCheckUtils]: 126: Hoare triple {75700#(< ~counter~0 10)} ~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; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,293 INFO L290 TraceCheckUtils]: 125: Hoare triple {75700#(< ~counter~0 10)} assume !(~c~0 >= ~b~0); {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,294 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #92#return; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,294 INFO L290 TraceCheckUtils]: 123: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,294 INFO L290 TraceCheckUtils]: 122: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,294 INFO L290 TraceCheckUtils]: 121: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,294 INFO L272 TraceCheckUtils]: 120: Hoare triple {75700#(< ~counter~0 10)} 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)); {75275#true} is VALID [2022-04-08 05:57:04,295 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #90#return; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,295 INFO L290 TraceCheckUtils]: 118: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,295 INFO L290 TraceCheckUtils]: 117: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,295 INFO L290 TraceCheckUtils]: 116: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,295 INFO L272 TraceCheckUtils]: 115: Hoare triple {75700#(< ~counter~0 10)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,295 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #88#return; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,295 INFO L290 TraceCheckUtils]: 113: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L290 TraceCheckUtils]: 112: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L290 TraceCheckUtils]: 111: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L272 TraceCheckUtils]: 110: Hoare triple {75700#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {75275#true} {75700#(< ~counter~0 10)} #86#return; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,296 INFO L290 TraceCheckUtils]: 108: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L290 TraceCheckUtils]: 107: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L290 TraceCheckUtils]: 106: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,296 INFO L272 TraceCheckUtils]: 105: Hoare triple {75700#(< ~counter~0 10)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,297 INFO L290 TraceCheckUtils]: 104: Hoare triple {75700#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,298 INFO L290 TraceCheckUtils]: 103: Hoare triple {75773#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75700#(< ~counter~0 10)} is VALID [2022-04-08 05:57:04,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {75773#(< ~counter~0 9)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,299 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #92#return; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,299 INFO L290 TraceCheckUtils]: 100: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,299 INFO L290 TraceCheckUtils]: 99: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,300 INFO L290 TraceCheckUtils]: 98: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,300 INFO L272 TraceCheckUtils]: 97: Hoare triple {75773#(< ~counter~0 9)} 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)); {75275#true} is VALID [2022-04-08 05:57:04,300 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #90#return; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,300 INFO L290 TraceCheckUtils]: 95: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,300 INFO L290 TraceCheckUtils]: 94: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,300 INFO L290 TraceCheckUtils]: 93: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,300 INFO L272 TraceCheckUtils]: 92: Hoare triple {75773#(< ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,301 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #88#return; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,301 INFO L290 TraceCheckUtils]: 90: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,301 INFO L290 TraceCheckUtils]: 89: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,301 INFO L290 TraceCheckUtils]: 88: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,301 INFO L272 TraceCheckUtils]: 87: Hoare triple {75773#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,302 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {75275#true} {75773#(< ~counter~0 9)} #86#return; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,302 INFO L272 TraceCheckUtils]: 82: Hoare triple {75773#(< ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {75773#(< ~counter~0 9)} assume !!(#t~post7 < 10);havoc #t~post7; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,303 INFO L290 TraceCheckUtils]: 80: Hoare triple {75843#(< ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75773#(< ~counter~0 9)} is VALID [2022-04-08 05:57:04,303 INFO L290 TraceCheckUtils]: 79: Hoare triple {75843#(< ~counter~0 8)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75843#(< ~counter~0 8)} is VALID [2022-04-08 05:57:04,304 INFO L290 TraceCheckUtils]: 78: Hoare triple {75843#(< ~counter~0 8)} assume !!(#t~post6 < 10);havoc #t~post6; {75843#(< ~counter~0 8)} is VALID [2022-04-08 05:57:04,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {75595#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75843#(< ~counter~0 8)} is VALID [2022-04-08 05:57:04,305 INFO L290 TraceCheckUtils]: 76: Hoare triple {75595#(<= ~counter~0 6)} ~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; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,305 INFO L290 TraceCheckUtils]: 75: Hoare triple {75595#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,306 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #92#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,306 INFO L290 TraceCheckUtils]: 73: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,306 INFO L290 TraceCheckUtils]: 72: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,306 INFO L290 TraceCheckUtils]: 71: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,306 INFO L272 TraceCheckUtils]: 70: Hoare triple {75595#(<= ~counter~0 6)} 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)); {75275#true} is VALID [2022-04-08 05:57:04,306 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #90#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,307 INFO L290 TraceCheckUtils]: 67: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,307 INFO L272 TraceCheckUtils]: 65: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,307 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #88#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,307 INFO L290 TraceCheckUtils]: 63: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,308 INFO L272 TraceCheckUtils]: 60: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,308 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {75275#true} {75595#(<= ~counter~0 6)} #86#return; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,308 INFO L290 TraceCheckUtils]: 58: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,308 INFO L272 TraceCheckUtils]: 55: Hoare triple {75595#(<= ~counter~0 6)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {75595#(<= ~counter~0 6)} assume !!(#t~post7 < 10);havoc #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {75525#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75595#(<= ~counter~0 6)} is VALID [2022-04-08 05:57:04,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {75525#(<= ~counter~0 5)} assume !!(~c~0 >= ~b~0);~c~0 := ~c~0 - ~b~0;~k~0 := 1 + ~k~0; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,310 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #92#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,310 INFO L290 TraceCheckUtils]: 50: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,311 INFO L272 TraceCheckUtils]: 47: Hoare triple {75525#(<= ~counter~0 5)} 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)); {75275#true} is VALID [2022-04-08 05:57:04,311 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #90#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,311 INFO L272 TraceCheckUtils]: 42: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,312 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #88#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,312 INFO L272 TraceCheckUtils]: 37: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,313 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {75275#true} {75525#(<= ~counter~0 5)} #86#return; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,313 INFO L272 TraceCheckUtils]: 32: Hoare triple {75525#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,313 INFO L290 TraceCheckUtils]: 31: Hoare triple {75525#(<= ~counter~0 5)} assume !!(#t~post7 < 10);havoc #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {75515#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75525#(<= ~counter~0 5)} is VALID [2022-04-08 05:57:04,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {75515#(<= ~counter~0 4)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {75515#(<= ~counter~0 4)} is VALID [2022-04-08 05:57:04,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {75515#(<= ~counter~0 4)} assume !!(#t~post6 < 10);havoc #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-08 05:57:04,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {75442#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75515#(<= ~counter~0 4)} is VALID [2022-04-08 05:57:04,316 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #84#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,316 INFO L272 TraceCheckUtils]: 22: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,316 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #82#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,317 INFO L272 TraceCheckUtils]: 17: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {75442#(<= ~counter~0 3)} ~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; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #80#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,318 INFO L272 TraceCheckUtils]: 11: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75275#true} {75442#(<= ~counter~0 3)} #78#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {75275#true} assume true; {75275#true} is VALID [2022-04-08 05:57:04,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {75275#true} assume !(0 == ~cond); {75275#true} is VALID [2022-04-08 05:57:04,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {75275#true} ~cond := #in~cond; {75275#true} is VALID [2022-04-08 05:57:04,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {75442#(<= ~counter~0 3)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {75275#true} is VALID [2022-04-08 05:57:04,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {75442#(<= ~counter~0 3)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {75442#(<= ~counter~0 3)} call #t~ret8 := main(); {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75442#(<= ~counter~0 3)} {75275#true} #98#return; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {75442#(<= ~counter~0 3)} assume true; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {75275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {75442#(<= ~counter~0 3)} is VALID [2022-04-08 05:57:04,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {75275#true} call ULTIMATE.init(); {75275#true} is VALID [2022-04-08 05:57:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 32 proven. 50 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-04-08 05:57:04,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 05:57:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774680830] [2022-04-08 05:57:04,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 05:57:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128409539] [2022-04-08 05:57:04,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128409539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 05:57:04,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 05:57:04,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 05:57:04,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 05:57:04,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095422519] [2022-04-08 05:57:04,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095422519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 05:57:04,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 05:57:04,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 05:57:04,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902622478] [2022-04-08 05:57:04,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 05:57:04,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) Word has length 133 [2022-04-08 05:57:04,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 05:57:04,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:57:04,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:57:04,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 05:57:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 05:57:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 05:57:04,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 05:57:04,406 INFO L87 Difference]: Start difference. First operand 613 states and 769 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:57:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:57:05,964 INFO L93 Difference]: Finished difference Result 629 states and 787 transitions. [2022-04-08 05:57:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 05:57:05,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) Word has length 133 [2022-04-08 05:57:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 05:57:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:57:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-08 05:57:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:57:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 150 transitions. [2022-04-08 05:57:05,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 150 transitions. [2022-04-08 05:57:06,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:57:06,094 INFO L225 Difference]: With dead ends: 629 [2022-04-08 05:57:06,094 INFO L226 Difference]: Without dead ends: 622 [2022-04-08 05:57:06,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2022-04-08 05:57:06,095 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 05:57:06,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 05:57:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-04-08 05:57:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2022-04-08 05:57:06,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 05:57:06,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:06,943 INFO L74 IsIncluded]: Start isIncluded. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:06,944 INFO L87 Difference]: Start difference. First operand 622 states. Second operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:06,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:57:06,956 INFO L93 Difference]: Finished difference Result 622 states and 778 transitions. [2022-04-08 05:57:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-08 05:57:06,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:57:06,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:57:06,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 622 states. [2022-04-08 05:57:06,957 INFO L87 Difference]: Start difference. First operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) Second operand 622 states. [2022-04-08 05:57:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 05:57:06,969 INFO L93 Difference]: Finished difference Result 622 states and 778 transitions. [2022-04-08 05:57:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-08 05:57:06,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 05:57:06,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 05:57:06,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 05:57:06,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 05:57:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 410 states have (on average 1.1878048780487804) internal successors, (487), 418 states have internal predecessors, (487), 147 states have call successors, (147), 65 states have call predecessors, (147), 64 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2022-04-08 05:57:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 778 transitions. [2022-04-08 05:57:06,987 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 778 transitions. Word has length 133 [2022-04-08 05:57:06,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 05:57:06,987 INFO L478 AbstractCegarLoop]: Abstraction has 622 states and 778 transitions. [2022-04-08 05:57:06,987 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 7 states have call successors, (23), 7 states have call predecessors, (23), 5 states have return successors, (21), 5 states have call predecessors, (21), 6 states have call successors, (21) [2022-04-08 05:57:06,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 622 states and 778 transitions. [2022-04-08 05:57:08,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 05:57:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 778 transitions. [2022-04-08 05:57:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-08 05:57:08,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 05:57:08,425 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 05:57:08,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 05:57:08,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 05:57:08,639 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 05:57:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 05:57:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 9 times [2022-04-08 05:57:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 05:57:08,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2066949356] [2022-04-08 05:57:08,639 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 05:57:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1894865945, now seen corresponding path program 10 times [2022-04-08 05:57:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 05:57:08,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951639058] [2022-04-08 05:57:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 05:57:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 05:57:08,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 05:57:08,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79152041] [2022-04-08 05:57:08,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 05:57:08,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 05:57:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 05:57:08,649 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 05:57:08,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 05:57:08,719 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 05:57:08,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 05:57:08,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-08 05:57:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 05:57:08,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 05:57:18,823 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:57:18,837 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 05:57:19,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {79842#true} call ULTIMATE.init(); {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {79842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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);~counter~0 := 0; {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79842#true} {79842#true} #98#return; {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {79842#true} call #t~ret8 := main(); {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {79842#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L272 TraceCheckUtils]: 6: Hoare triple {79842#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {79842#true} is VALID [2022-04-08 05:57:19,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {79842#true} {79842#true} #78#return; {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L272 TraceCheckUtils]: 11: Hoare triple {79842#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {79842#true} {79842#true} #80#return; {79842#true} is VALID [2022-04-08 05:57:19,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {79842#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; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:57:19,433 INFO L272 TraceCheckUtils]: 17: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {79842#true} is VALID [2022-04-08 05:57:19,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,433 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {79842#true} {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #82#return; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:57:19,433 INFO L272 TraceCheckUtils]: 22: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {79842#true} is VALID [2022-04-08 05:57:19,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,434 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {79842#true} {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #84#return; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:57:19,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:57:19,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 05:57:19,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {79895#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,436 INFO L272 TraceCheckUtils]: 32: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= 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)); {79842#true} is VALID [2022-04-08 05:57:19,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,437 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {79842#true} {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #86#return; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,437 INFO L272 TraceCheckUtils]: 37: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= 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)); {79842#true} is VALID [2022-04-08 05:57:19,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,438 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {79842#true} {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #88#return; {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,438 INFO L272 TraceCheckUtils]: 42: Hoare triple {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= 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)); {79842#true} is VALID [2022-04-08 05:57:19,438 INFO L290 TraceCheckUtils]: 43: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:19,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,440 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {79935#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #90#return; {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,440 INFO L272 TraceCheckUtils]: 47: Hoare triple {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= 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)); {79842#true} is VALID [2022-04-08 05:57:19,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,441 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {79842#true} {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #92#return; {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-08 05:57:19,443 INFO L290 TraceCheckUtils]: 53: Hoare triple {79989#(and (= main_~r~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~k~0 0) (= main_~s~0 1) (= 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; {80011#(and (= main_~s~0 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-08 05:57:19,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80011#(and (= main_~s~0 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-08 05:57:19,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {80011#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post6 < 10);havoc #t~post6; {80011#(and (= main_~s~0 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-08 05:57:19,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {80011#(and (= main_~s~0 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; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,445 INFO L272 TraceCheckUtils]: 59: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 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)); {79842#true} is VALID [2022-04-08 05:57:19,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,446 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,446 INFO L272 TraceCheckUtils]: 64: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 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)); {79842#true} is VALID [2022-04-08 05:57:19,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,446 INFO L290 TraceCheckUtils]: 66: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,446 INFO L290 TraceCheckUtils]: 67: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,447 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,447 INFO L272 TraceCheckUtils]: 69: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 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)); {79842#true} is VALID [2022-04-08 05:57:19,447 INFO L290 TraceCheckUtils]: 70: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,447 INFO L290 TraceCheckUtils]: 71: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,447 INFO L290 TraceCheckUtils]: 72: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,448 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,448 INFO L272 TraceCheckUtils]: 74: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 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)); {79842#true} is VALID [2022-04-08 05:57:19,448 INFO L290 TraceCheckUtils]: 75: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,448 INFO L290 TraceCheckUtils]: 76: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,448 INFO L290 TraceCheckUtils]: 77: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,449 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {79842#true} {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #92#return; {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 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-08 05:57:19,450 INFO L290 TraceCheckUtils]: 79: Hoare triple {80021#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 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; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,451 INFO L290 TraceCheckUtils]: 80: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,451 INFO L290 TraceCheckUtils]: 81: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 10);havoc #t~post7; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,451 INFO L272 TraceCheckUtils]: 82: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {79842#true} is VALID [2022-04-08 05:57:19,451 INFO L290 TraceCheckUtils]: 83: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,451 INFO L290 TraceCheckUtils]: 84: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,452 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #86#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,452 INFO L272 TraceCheckUtils]: 87: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {79842#true} is VALID [2022-04-08 05:57:19,452 INFO L290 TraceCheckUtils]: 88: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,452 INFO L290 TraceCheckUtils]: 89: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,453 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #88#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,453 INFO L272 TraceCheckUtils]: 92: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {79842#true} is VALID [2022-04-08 05:57:19,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,453 INFO L290 TraceCheckUtils]: 94: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,453 INFO L290 TraceCheckUtils]: 95: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,454 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #90#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,454 INFO L272 TraceCheckUtils]: 97: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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)); {79842#true} is VALID [2022-04-08 05:57:19,454 INFO L290 TraceCheckUtils]: 98: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,454 INFO L290 TraceCheckUtils]: 99: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,454 INFO L290 TraceCheckUtils]: 100: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,455 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {79842#true} {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #92#return; {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-08 05:57:19,456 INFO L290 TraceCheckUtils]: 102: Hoare triple {80091#(and (= main_~s~0 0) (= main_~p~0 0) (= (+ main_~a~0 (* (- 1) main_~b~0)) main_~c~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; {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:57:19,457 INFO L290 TraceCheckUtils]: 103: Hoare triple {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:57:19,457 INFO L290 TraceCheckUtils]: 104: Hoare triple {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} assume !!(#t~post7 < 10);havoc #t~post7; {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:57:19,457 INFO L272 TraceCheckUtils]: 105: Hoare triple {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {79842#true} is VALID [2022-04-08 05:57:19,458 INFO L290 TraceCheckUtils]: 106: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:19,458 INFO L290 TraceCheckUtils]: 107: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,458 INFO L290 TraceCheckUtils]: 108: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,459 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {80161#(and (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} #86#return; {80183#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} is VALID [2022-04-08 05:57:19,459 INFO L272 TraceCheckUtils]: 110: Hoare triple {80183#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {79842#true} is VALID [2022-04-08 05:57:19,459 INFO L290 TraceCheckUtils]: 111: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:19,460 INFO L290 TraceCheckUtils]: 112: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,460 INFO L290 TraceCheckUtils]: 113: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,462 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {80183#(and (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= (+ main_~a~0 (* (- 1) main_~b~0)) (+ main_~c~0 main_~b~0)))} #88#return; {80199#(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_~p~0 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-08 05:57:19,462 INFO L272 TraceCheckUtils]: 115: Hoare triple {80199#(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_~p~0 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)); {79842#true} is VALID [2022-04-08 05:57:19,462 INFO L290 TraceCheckUtils]: 116: Hoare triple {79842#true} ~cond := #in~cond; {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:19,463 INFO L290 TraceCheckUtils]: 117: Hoare triple {79978#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,463 INFO L290 TraceCheckUtils]: 118: Hoare triple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 05:57:19,466 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {79982#(not (= |__VERIFIER_assert_#in~cond| 0))} {80199#(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_~p~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= (* main_~b~0 main_~k~0) (* main_~b~0 2)))} #90#return; {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 0) (= main_~r~0 1))} is VALID [2022-04-08 05:57:19,466 INFO L272 TraceCheckUtils]: 120: Hoare triple {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 0) (= main_~r~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)); {79842#true} is VALID [2022-04-08 05:57:19,466 INFO L290 TraceCheckUtils]: 121: Hoare triple {79842#true} ~cond := #in~cond; {79842#true} is VALID [2022-04-08 05:57:19,466 INFO L290 TraceCheckUtils]: 122: Hoare triple {79842#true} assume !(0 == ~cond); {79842#true} is VALID [2022-04-08 05:57:19,466 INFO L290 TraceCheckUtils]: 123: Hoare triple {79842#true} assume true; {79842#true} is VALID [2022-04-08 05:57:19,467 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {79842#true} {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 0) (= main_~r~0 1))} #92#return; {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 0) (= main_~r~0 1))} is VALID [2022-04-08 05:57:19,467 INFO L290 TraceCheckUtils]: 125: Hoare triple {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 0) (= main_~r~0 1))} assume !(~c~0 >= ~b~0); {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 0) (= main_~r~0 1))} is VALID [2022-04-08 05:57:19,484 INFO L290 TraceCheckUtils]: 126: Hoare triple {80215#(and (= main_~x~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= (+ (* 2 (* main_~y~0 main_~s~0)) (* (* main_~q~0 main_~x~0) 2)) (* main_~k~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= main_~s~0 0) (= (+ main_~c~0 (* main_~k~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_~p~0 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; {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is VALID [2022-04-08 05:57:19,487 INFO L290 TraceCheckUtils]: 127: Hoare triple {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is VALID [2022-04-08 05:57:19,488 INFO L290 TraceCheckUtils]: 128: Hoare triple {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} assume !!(#t~post6 < 10);havoc #t~post6; {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} is VALID [2022-04-08 05:57:19,490 INFO L290 TraceCheckUtils]: 129: Hoare triple {80237#(and (= main_~s~0 1) (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))))} assume !(0 != ~b~0); {80247#(and (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0) 0))} is VALID [2022-04-08 05:57:19,490 INFO L272 TraceCheckUtils]: 130: Hoare triple {80247#(and (exists ((main_~k~0 Int)) (and (not (= main_~k~0 0)) (= (mod (* (- 1) main_~q~0) main_~k~0) 0) (= (* 2 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (* main_~k~0 main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))) (= main_~x~0 (* main_~x~0 (div (* (- 1) main_~q~0) main_~k~0))))) (= main_~s~0 1) (= (+ (* main_~q~0 main_~x~0) main_~y~0) 0))} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {80251#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 05:57:19,491 INFO L290 TraceCheckUtils]: 131: Hoare triple {80251#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {80255#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 05:57:19,491 INFO L290 TraceCheckUtils]: 132: Hoare triple {80255#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {79843#false} is VALID [2022-04-08 05:57:19,491 INFO L290 TraceCheckUtils]: 133: Hoare triple {79843#false} assume !false; {79843#false} is VALID [2022-04-08 05:57:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 133 proven. 95 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2022-04-08 05:57:19,492 INFO L328 TraceCheckSpWp]: Computing backward predicates...